Base | Representation |
---|---|
bin | 110001011110100010… |
… | …001101000000000000 |
3 | 12002010102020201200000 |
4 | 301132202031000000 |
5 | 1332300130211000 |
6 | 40223334400000 |
7 | 3560334264330 |
oct | 613642150000 |
9 | 162112221600 |
10 | 53125632000 |
11 | 205920416a1 |
12 | a367800000 |
13 | 50184a080c |
14 | 27dd8bb0c0 |
15 | 15adea3000 |
hex | c5e88d000 |
53125632000 has 1248 divisors, whose sum is σ = 230698401024. Its totient is φ = 11943936000.
The previous prime is 53125631983. The next prime is 53125632013. The reversal of 53125632000 is 23652135.
53125632000 is a `hidden beast` number, since 5 + 3 + 1 + 25 + 632 + 0 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 870911970 + ... + 870912030.
It is an arithmetic number, because the mean of its divisors is an integer number (184854488).
Almost surely, 253125632000 is an apocalyptic number.
53125632000 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 53125632000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115349200512).
53125632000 is an abundant number, since it is smaller than the sum of its proper divisors (177572769024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53125632000 is an frugal number, since it uses more digits than its factorization.
53125632000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122 (or 78 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The spelling of 53125632000 in words is "fifty-three billion, one hundred twenty-five million, six hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •