Base | Representation |
---|---|
bin | 10111110001001110010100… |
… | …01001011100101000000000 |
3 | 20212001212000220212221100011 |
4 | 23320213022021130220000 |
5 | 23322333100203433300 |
6 | 303055551050434304 |
7 | 14003204535441514 |
oct | 1370471211345000 |
9 | 225055026787304 |
10 | 52268848499200 |
11 | 15722104371593 |
12 | 5a42077732994 |
13 | 2321c14caa928 |
14 | cc9b7bc88144 |
15 | 609975566eba |
hex | 2f89ca25ca00 |
52268848499200 has 480 divisors, whose sum is σ = 136612394747136. Its totient is φ = 19780312104960.
The previous prime is 52268848499069. The next prime is 52268848499213. The reversal of 52268848499200 is 299484886225.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11817508189 + ... + 11817512611.
Almost surely, 252268848499200 is an apocalyptic number.
52268848499200 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 52268848499200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68306197373568).
52268848499200 is an abundant number, since it is smaller than the sum of its proper divisors (84343546247936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52268848499200 is a wasteful number, since it uses less digits than its factorization.
52268848499200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4904 (or 4883 counting only the distinct ones).
The product of its (nonzero) digits is 159252480, while the sum is 67.
The spelling of 52268848499200 in words is "fifty-two trillion, two hundred sixty-eight billion, eight hundred forty-eight million, four hundred ninety-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •