1514743552 is an even 10-digits composite number following 1514743551
and preceding 1514743553. In scientific notation, it is written as 1.514743552 × 10^9.
The sum of its digits is 37. It has a total of 11 prime factors and 72 positive divisors.
There are 647187456 positive integers (up to 1514743552) that are relatively prime to 1514743552.
Prime Factorization
2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 7 × 2207 × 383
Composite number
| ω |
Distinct Factors |
4 |
Total number of distinct prime factors |
| Ω |
Total Factors |
11 |
Total number of prime factors |
| rad |
Radical |
11833934 |
Product of the distinct prime numbers |
The prime factorization of 1514743552 is 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 7 × 2207 × 383.
Since it has a total of 11 prime factors.
1, 2, 4, 7, 8, 14, 16, 28, 32, 56, 64, 112, 128, 224, 256, 383, 448, 766, 896, 1532, 1792, 2207, 2681, 3064, 4414, 5362, 6128, 8828, 10724, 12256, 15449, 17656, 21448, 24512, 30898, 35312, 42896, 49024, 61796, 70624, 85792, 98048, 123592, 141248, 171584, 247184, 282496, 343168, 494368, 564992, 686336, 845281, 988736, 1690562, 1977472, 3381124, 3954944, 5916967, 6762248, 11833934, 13524496, 23667868, 27048992, 47335736, 54097984, 94671472, 108195968, 189342944, 216391936, 378685888, 757371776, 1514743552
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 |
-1514743551 |
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 1514743552 can be divided by 72 positive divisors.
The sum of these divisors (counting 1514743552) is 1, the average is 0.013888888888889.