Base | Representation |
---|---|
bin | 11000001001110000010010… |
… | …11101010001100011000000 |
3 | 20222001102122101022120010100 |
4 | 30010320021131101203000 |
5 | 23430140302402020303 |
6 | 304543104515202400 |
7 | 14121124016224401 |
oct | 1404701135214300 |
9 | 228042571276110 |
10 | 53111724251328 |
11 | 15a176127a1476 |
12 | 5b594a8ba6400 |
13 | 238354ca3a822 |
14 | d1889a6bd9a8 |
15 | 621857a408a3 |
hex | 304e097518c0 |
53111724251328 has 168 divisors, whose sum is σ = 152460110711376. Its totient is φ = 17677757491200.
The previous prime is 53111724251213. The next prime is 53111724251407. The reversal of 53111724251328 is 82315242711135.
53111724251328 is a `hidden beast` number, since 5 + 3 + 1 + 1 + 1 + 72 + 4 + 251 + 328 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4492991658 + ... + 4493003478.
Almost surely, 253111724251328 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 53111724251328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76230055355688).
53111724251328 is an abundant number, since it is smaller than the sum of its proper divisors (99348386460048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53111724251328 is a wasteful number, since it uses less digits than its factorization.
53111724251328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22703 (or 22690 counting only the distinct ones).
The product of its digits is 403200, while the sum is 45.
The spelling of 53111724251328 in words is "fifty-three trillion, one hundred eleven billion, seven hundred twenty-four million, two hundred fifty-one thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •