1036543728 is an even 10-digits composite number following 1036543727
and preceding 1036543729. In scientific notation, it is written as 1.036543728 × 10^9.
The sum of its digits is 39. It has a total of 8 prime factors and 80 positive divisors.
There are 312000000 positive integers (up to 1036543728) that are relatively prime to 1036543728.
Prime Factorization
2 × 2 × 2 × 2 × 3 × 11 × 151 × 13001
Composite number
| ω |
Distinct Factors |
5 |
Total number of distinct prime factors |
| Ω |
Total Factors |
8 |
Total number of prime factors |
| rad |
Radical |
129567966 |
Product of the distinct prime numbers |
The prime factorization of 1036543728 is 2 × 2 × 2 × 2 × 3 × 11 × 151 × 13001.
Since it has a total of 8 prime factors.
1, 2, 3, 4, 6, 8, 11, 12, 16, 22, 24, 33, 44, 48, 66, 88, 132, 151, 176, 264, 302, 453, 528, 604, 906, 1208, 1661, 1812, 2416, 3322, 3624, 4983, 6644, 7248, 9966, 13001, 13288, 19932, 26002, 26576, 39003, 39864, 52004, 78006, 79728, 104008, 143011, 156012, 208016, 286022, 312024, 429033, 572044, 624048, 858066, 1144088, 1716132, 1963151, 2288176, 3432264, 3926302, 5889453, 6864528, 7852604, 11778906, 15705208, 21594661, 23557812, 31410416, 43189322, 47115624, 64783983, 86378644, 94231248, 129567966, 172757288, 259135932, 345514576, 518271864, 1036543728
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 |
-1036543727 |
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 1036543728 can be divided by 80 positive divisors.
The sum of these divisors (counting 1036543728) is 1, the average is 0.0125.