Base | Representation |
---|---|
bin | 110001000010111010… |
… | …000100001001101000 |
3 | 12000221010002010211000 |
4 | 301002322010021220 |
5 | 1330323001001120 |
6 | 40105340035000 |
7 | 3543005451411 |
oct | 610272041150 |
9 | 160833063730 |
10 | 52662125160 |
11 | 20374440097 |
12 | a258532a60 |
13 | 4c73455008 |
14 | 2798104808 |
15 | 1583447990 |
hex | c42e84268 |
52662125160 has 256 divisors, whose sum is σ = 180607737600. Its totient is φ = 13639228416.
The previous prime is 52662125149. The next prime is 52662125177. The reversal of 52662125160 is 6152126625.
52662125160 is a `hidden beast` number, since 5 + 2 + 6 + 621 + 25 + 1 + 6 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 63 ways as a sum of consecutive naturals, for example, 36242994 + ... + 36244446.
It is an arithmetic number, because the mean of its divisors is an integer number (705498975).
Almost surely, 252662125160 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 52662125160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90303868800).
52662125160 is an abundant number, since it is smaller than the sum of its proper divisors (127945612440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52662125160 is a wasteful number, since it uses less digits than its factorization.
52662125160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2417 (or 2407 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 52662125160 in words is "fifty-two billion, six hundred sixty-two million, one hundred twenty-five thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •