Base | Representation |
---|---|
bin | 110001010110110110… |
… | …000001000000000000 |
3 | 12001210102110122000100 |
4 | 301112312001000000 |
5 | 1332014112424000 |
6 | 40202445122400 |
7 | 3554206510140 |
oct | 612666010000 |
9 | 161712418010 |
10 | 52996608000 |
11 | 20526226a96 |
12 | a330559400 |
13 | 4cc783735b |
14 | 27ca6d2920 |
15 | 15a29b8a00 |
hex | c56d81000 |
52996608000 has 1248 divisors, whose sum is σ = 229635274752. Its totient is φ = 11501568000.
The previous prime is 52996607999. The next prime is 52996608011. The reversal of 52996608000 is 80669925.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 999935974 + ... + 999936026.
It is an arithmetic number, because the mean of its divisors is an integer number (184002624).
Almost surely, 252996608000 is an apocalyptic number.
52996608000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52996608000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114817637376).
52996608000 is an abundant number, since it is smaller than the sum of its proper divisors (176638666752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52996608000 is a wasteful number, since it uses less digits than its factorization.
52996608000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136 (or 101 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 45.
The spelling of 52996608000 in words is "fifty-two billion, nine hundred ninety-six million, six hundred eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •