Base | Representation |
---|---|
bin | 110001011000111001… |
… | …101000111101000000 |
3 | 12001212211101122022020 |
4 | 301120321220331000 |
5 | 1332101431100022 |
6 | 40210120441440 |
7 | 3555106006320 |
oct | 613071507500 |
9 | 161784348266 |
10 | 53031112512 |
11 | 20543753814 |
12 | a340019280 |
13 | 5001a28721 |
14 | 27d1115280 |
15 | 15a5a3235c |
hex | c58e68f40 |
53031112512 has 224 divisors, whose sum is σ = 168873830400. Its totient is φ = 14359099392.
The previous prime is 53031112501. The next prime is 53031112513. The reversal of 53031112512 is 21521113035.
It is a tau number, because it is divible by the number of its divisors (224).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53031112513) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3361539 + ... + 3377277.
Almost surely, 253031112512 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 53031112512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84436915200).
53031112512 is an abundant number, since it is smaller than the sum of its proper divisors (115842717888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53031112512 is a wasteful number, since it uses less digits than its factorization.
53031112512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15893 (or 15883 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 53031112512 its reverse (21521113035), we get a palindrome (74552225547).
The spelling of 53031112512 in words is "fifty-three billion, thirty-one million, one hundred twelve thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •