1015147536 is an even 10-digits composite number following 1015147535
and preceding 1015147537. In scientific notation, it is written as 1.015147536 × 10^9.
The sum of its digits is 33. It has a total of 8 prime factors and 80 positive divisors.
There are 304727040 positive integers (up to 1015147536) that are relatively prime to 1015147536.
Prime Factorization
2 × 2 × 2 × 2 × 3 × 13 × 41 × 39679
Composite number
| ω |
Distinct Factors |
5 |
Total number of distinct prime factors |
| Ω |
Total Factors |
8 |
Total number of prime factors |
| rad |
Radical |
126893442 |
Product of the distinct prime numbers |
The prime factorization of 1015147536 is 2 × 2 × 2 × 2 × 3 × 13 × 41 × 39679.
Since it has a total of 8 prime factors.
1, 2, 3, 4, 6, 8, 12, 13, 16, 24, 26, 39, 41, 48, 52, 78, 82, 104, 123, 156, 164, 208, 246, 312, 328, 492, 533, 624, 656, 984, 1066, 1599, 1968, 2132, 3198, 4264, 6396, 8528, 12792, 25584, 39679, 79358, 119037, 158716, 238074, 317432, 476148, 515827, 634864, 952296, 1031654, 1547481, 1626839, 1904592, 2063308, 3094962, 3253678, 4126616, 4880517, 6189924, 6507356, 8253232, 9761034, 12379848, 13014712, 19522068, 21148907, 24759696, 26029424, 39044136, 42297814, 63446721, 78088272, 84595628, 126893442, 169191256, 253786884, 338382512, 507573768, 1015147536
80 divisors
| τ |
Total Divisors |
80 |
Total number of the positive divisors of n |
| σ |
Sum of Divisors |
1 |
Sum of all the positive divisors of n |
| s |
Aliquot Sum |
-1015147535 |
Sum of the proper positive divisors of n |
| A |
Arithmetic Mean |
0.0125 |
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 |
80 |
Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors |
The number 1015147536 can be divided by 80 positive divisors.
The sum of these divisors (counting 1015147536) is 1, the average is 0.0125.