Base | Representation |
---|---|
bin | 101111100000100110… |
… | …010001101110000000 |
3 | 11212200011112020211100 |
4 | 233200212101232000 |
5 | 1313433232130223 |
6 | 35233540414400 |
7 | 3454100252655 |
oct | 574046215600 |
9 | 155604466740 |
10 | 51012770688 |
11 | 1a6a8419720 |
12 | 9a780a7400 |
13 | 4a6c82b919 |
14 | 267d043c2c |
15 | 14d874a043 |
hex | be0991b80 |
51012770688 has 576 divisors, whose sum is σ = 170646652800. Its totient is φ = 14499072000.
The previous prime is 51012770687. The next prime is 51012770701. The reversal of 51012770688 is 88607721015.
It is a happy number.
51012770688 is a `hidden beast` number, since 510 + 1 + 2 + 7 + 70 + 68 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (576).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51012770687) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 718489693 + ... + 718489763.
It is an arithmetic number, because the mean of its divisors is an integer number (296261550).
Almost surely, 251012770688 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 51012770688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85323326400).
51012770688 is an abundant number, since it is smaller than the sum of its proper divisors (119633882112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51012770688 is a wasteful number, since it uses less digits than its factorization.
51012770688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223 (or 177 counting only the distinct ones).
The product of its (nonzero) digits is 188160, while the sum is 45.
The spelling of 51012770688 in words is "fifty-one billion, twelve million, seven hundred seventy thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •