Base | Representation |
---|---|
bin | 10111011110101001110111… |
… | …00101100011111010000000 |
3 | 20202210212010100000111012020 |
4 | 23233110323211203322000 |
5 | 23231404340200123420 |
6 | 301450510210401440 |
7 | 13606126252136121 |
oct | 1357247345437200 |
9 | 222725110014166 |
10 | 51630801567360 |
11 | 154a6555521a74 |
12 | 595a48ab90280 |
13 | 22a69c0ac2502 |
14 | ca6d30996048 |
15 | 5e8080404340 |
hex | 2ef53b963e80 |
51630801567360 has 512 divisors, whose sum is σ = 174521358950400. Its totient is φ = 12960896729088.
The previous prime is 51630801567341. The next prime is 51630801567361. The reversal of 51630801567360 is 6376510803615.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (51630801567361) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1347937969 + ... + 1347976271.
It is an arithmetic number, because the mean of its divisors is an integer number (340862029200).
Almost surely, 251630801567360 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 51630801567360, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87260679475200).
51630801567360 is an abundant number, since it is smaller than the sum of its proper divisors (122890557383040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51630801567360 is a wasteful number, since it uses less digits than its factorization.
51630801567360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38960 (or 38948 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 51.
The spelling of 51630801567360 in words is "fifty-one trillion, six hundred thirty billion, eight hundred one million, five hundred sixty-seven thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •