Base | Representation |
---|---|
bin | 110001000000011101… |
… | …010011111000000000 |
3 | 12000211020202102220200 |
4 | 301000131103320000 |
5 | 1330231441023320 |
6 | 40101311205200 |
7 | 3541666254156 |
oct | 610035237000 |
9 | 160736672820 |
10 | 52621032960 |
11 | 203532239a1 |
12 | a246816800 |
13 | 4c67a982c2 |
14 | 27928893d6 |
15 | 157ea2c290 |
hex | c40753e00 |
52621032960 has 480 divisors, whose sum is σ = 198231276672. Its totient is φ = 12846366720.
The previous prime is 52621032941. The next prime is 52621033021. The reversal of 52621032960 is 6923012625.
52621032960 is a `hidden beast` number, since 5 + 2 + 621 + 0 + 3 + 29 + 6 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (480).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14490345 + ... + 14493975.
Almost surely, 252621032960 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52621032960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99115638336).
52621032960 is an abundant number, since it is smaller than the sum of its proper divisors (145610243712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52621032960 is a wasteful number, since it uses less digits than its factorization.
52621032960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3714 (or 3695 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The spelling of 52621032960 in words is "fifty-two billion, six hundred twenty-one million, thirty-two thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •