Base | Representation |
---|---|
bin | 110000011000000001… |
… | …111010111010000000 |
3 | 11222001222110211001000 |
4 | 300120001322322000 |
5 | 1322334321423120 |
6 | 35510121412000 |
7 | 3516122132130 |
oct | 603001727200 |
9 | 158058424030 |
10 | 51942764160 |
11 | 20035377571 |
12 | a09763a000 |
13 | 4b8a3c7311 |
14 | 272a76aac0 |
15 | 15401ed990 |
hex | c1807ae80 |
51942764160 has 512 divisors, whose sum is σ = 211507200000. Its totient is φ = 11801382912.
The previous prime is 51942764141. The next prime is 51942764183. The reversal of 51942764160 is 6146724915.
51942764160 is a `hidden beast` number, since 5 + 1 + 9 + 427 + 64 + 160 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
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, 21650641 + ... + 21653039.
It is an arithmetic number, because the mean of its divisors is an integer number (413100000).
Almost surely, 251942764160 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 51942764160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105753600000).
51942764160 is an abundant number, since it is smaller than the sum of its proper divisors (159564435840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51942764160 is a wasteful number, since it uses less digits than its factorization.
51942764160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2613 (or 2595 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The spelling of 51942764160 in words is "fifty-one billion, nine hundred forty-two million, seven hundred sixty-four thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •