3048585568 is an even 10-digits composite number following 3048585567
and preceding 3048585569. In scientific notation, it is written as 3.048585568 × 10^9.
The sum of its digits is 52. It has a total of 9 prime factors and 72 positive divisors.
There are 1237759488 positive integers (up to 3048585568) that are relatively prime to 3048585568.
Prime Factorization
2 × 2 × 2 × 2 × 2 × 7 × 7 × 19 × 102329
Composite number
| ω |
Distinct Factors |
4 |
Total number of distinct prime factors |
| Ω |
Total Factors |
9 |
Total number of prime factors |
| rad |
Radical |
27219514 |
Product of the distinct prime numbers |
The prime factorization of 3048585568 is 2 × 2 × 2 × 2 × 2 × 7 × 7 × 19 × 102329.
Since it has a total of 9 prime factors.
1, 2, 4, 7, 8, 14, 16, 19, 28, 32, 38, 49, 56, 76, 98, 112, 133, 152, 196, 224, 266, 304, 392, 532, 608, 784, 931, 1064, 1568, 1862, 2128, 3724, 4256, 7448, 14896, 29792, 102329, 204658, 409316, 716303, 818632, 1432606, 1637264, 1944251, 2865212, 3274528, 3888502, 5014121, 5730424, 7777004, 10028242, 11460848, 13609757, 15554008, 20056484, 22921696, 27219514, 31108016, 40112968, 54439028, 62216032, 80225936, 95268299, 108878056, 160451872, 190536598, 217756112, 381073196, 435512224, 762146392, 1524292784, 3048585568
72 divisors
| τ |
Total Divisors |
72 |
Total number of the positive divisors of n |
| σ |
Sum of Divisors |
1 |
Sum of all the positive divisors of n |
| s |
Aliquot Sum |
-3048585567 |
Sum of the proper positive divisors of n |
| A |
Arithmetic Mean |
0.013888888888889 |
Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) |
| G |
Geometric Mean |
1 |
Returns the nth root of the product of n divisors |
| H |
Harmonic Mean |
72 |
Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors |
The number 3048585568 can be divided by 72 positive divisors.
The sum of these divisors (counting 3048585568) is 1, the average is 0.013888888888889.