Base | Representation |
---|---|
bin | 11000001010110111110011… |
… | …01111100000101011010100 |
3 | 20222012002201220212000012200 |
4 | 30011123321233200223110 |
5 | 23431302414004131400 |
6 | 305012454220444500 |
7 | 14123653255613205 |
oct | 1405337157405324 |
9 | 228162656760180 |
10 | 53150115302100 |
11 | 15a31923516103 |
12 | 5b64a220a9730 |
13 | 238705a672b0b |
14 | d1a69d3075ac |
15 | 62285315bb00 |
hex | 3056f9be0ad4 |
53150115302100 has 162 divisors, whose sum is σ = 169467614739150. Its totient is φ = 13933136749440.
The previous prime is 53150115302093. The next prime is 53150115302111. The reversal of 53150115302100 is 120351105135.
53150115302100 is a `hidden beast` number, since 5 + 3 + 1 + 501 + 1 + 53 + 0 + 2 + 100 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 18087634737936 + 35062480564164 = 4252956^2 + 5921358^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 5349675 + ... + 11615474.
Almost surely, 253150115302100 is an apocalyptic number.
53150115302100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
53150115302100 is an abundant number, since it is smaller than the sum of its proper divisors (116317499437050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53150115302100 is a wasteful number, since it uses less digits than its factorization.
53150115302100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16965287 (or 16965218 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
Adding to 53150115302100 its reverse (120351105135), we get a palindrome (53270466407235).
The spelling of 53150115302100 in words is "fifty-three trillion, one hundred fifty billion, one hundred fifteen million, three hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.347 sec. • engine limits •