2514156912 is an even 10-digits composite number following 2514156911
and preceding 2514156913. In scientific notation, it is written as 2.514156912 × 10^9.
The sum of its digits is 36. It has a total of 8 prime factors and 80 positive divisors.
There are 791368704 positive integers (up to 2514156912) that are relatively prime to 2514156912.
Prime Factorization
2 × 2 × 2 × 2 × 3 × 1047 × 19 × 2633
Composite number
| ω |
Distinct Factors |
5 |
Total number of distinct prime factors |
| Ω |
Total Factors |
8 |
Total number of prime factors |
| rad |
Radical |
314269614 |
Product of the distinct prime numbers |
The prime factorization of 2514156912 is 2 × 2 × 2 × 2 × 3 × 1047 × 19 × 2633.
Since it has a total of 8 prime factors.
1, 2, 3, 4, 6, 8, 12, 16, 19, 24, 38, 48, 57, 76, 114, 152, 228, 304, 456, 912, 1047, 2094, 2633, 3141, 4188, 5266, 6282, 7899, 8376, 10532, 12564, 15798, 16752, 19893, 21064, 25128, 31596, 39786, 42128, 50027, 50256, 59679, 63192, 79572, 100054, 119358, 126384, 150081, 159144, 200108, 238716, 300162, 318288, 400216, 477432, 600324, 800432, 954864, 1200648, 2401296, 2756751, 5513502, 8270253, 11027004, 16540506, 22054008, 33081012, 44108016, 52378269, 66162024, 104756538, 132324048, 157134807, 209513076, 314269614, 419026152, 628539228, 838052304, 1257078456, 2514156912
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 |
-2514156911 |
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 2514156912 can be divided by 80 positive divisors.
The sum of these divisors (counting 2514156912) is 1, the average is 0.0125.