Base | Representation |
---|---|
bin | 110000111100001111… |
… | …001010011000100000 |
3 | 12000122022111112012200 |
4 | 300330033022120200 |
5 | 1330110323341300 |
6 | 40050301253200 |
7 | 3540146313330 |
oct | 607417123040 |
9 | 160568445180 |
10 | 52550215200 |
11 | 2031725451a |
12 | a226b64200 |
13 | 4c562014c2 |
14 | 27872d30c0 |
15 | 15786de200 |
hex | c3c3ca620 |
52550215200 has 432 divisors, whose sum is σ = 222927606720. Its totient is φ = 11379087360.
The previous prime is 52550215169. The next prime is 52550215213. The reversal of 52550215200 is 251205525.
52550215200 is a `hidden beast` number, since 5 + 2 + 5 + 502 + 152 + 0 + 0 = 666.
It is a super-2 number, since 2×525502152002 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 930162 + ... + 985038.
Almost surely, 252550215200 is an apocalyptic number.
52550215200 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 52550215200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111463803360).
52550215200 is an abundant number, since it is smaller than the sum of its proper divisors (170377391520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52550215200 is a wasteful number, since it uses less digits than its factorization.
52550215200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54929 (or 54913 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 27.
The spelling of 52550215200 in words is "fifty-two billion, five hundred fifty million, two hundred fifteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •