Base | Representation |
---|---|
bin | 110001000011000010… |
… | …100110000010100000 |
3 | 12000221021021201222100 |
4 | 301003002212002200 |
5 | 1330324034023440 |
6 | 40105500010400 |
7 | 3543033453300 |
oct | 610302460240 |
9 | 160837251870 |
10 | 52664361120 |
11 | 20375727a98 |
12 | a259230a00 |
13 | 4c73a58977 |
14 | 2798527600 |
15 | 158373a230 |
hex | c430a60a0 |
52664361120 has 864 divisors, whose sum is σ = 222330588480. Its totient is φ = 11287019520.
The previous prime is 52664361103. The next prime is 52664361151. The reversal of 52664361120 is 2116346625.
52664361120 is a `hidden beast` number, since 5 + 2 + 6 + 643 + 6 + 1 + 1 + 2 + 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 (11) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 218524200 + ... + 218524440.
It is an arithmetic number, because the mean of its divisors is an integer number (257327070).
Almost surely, 252664361120 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 52664361120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111165294240).
52664361120 is an abundant number, since it is smaller than the sum of its proper divisors (169666227360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52664361120 is a wasteful number, since it uses less digits than its factorization.
52664361120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458 (or 440 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 52664361120 in words is "fifty-two billion, six hundred sixty-four million, three hundred sixty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •