Base | Representation |
---|---|
bin | 1011011000010111011111… |
… | …0101110000101101011100 |
3 | 1122022020212221002120021002 |
4 | 2312011313311300231130 |
5 | 3120004114040040400 |
6 | 42340301405325432 |
7 | 2431024002503213 |
oct | 266056765605534 |
9 | 48266787076232 |
10 | 12513250315100 |
11 | 3a94926646137 |
12 | 14a119a266878 |
13 | 6c9cc0a322a2 |
14 | 3139048ca07a |
15 | 16a771e4ced5 |
hex | b6177d70b5c |
12513250315100 has 18 divisors (see below), whose sum is σ = 27153753183984. Its totient is φ = 5005300126000.
The previous prime is 12513250315091. The next prime is 12513250315109. The reversal of 12513250315100 is 151305231521.
It is an interprime number because it is at equal distance from previous prime (12513250315091) and next prime (12513250315109).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12513250315109) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 62566251476 + ... + 62566251675.
Almost surely, 212513250315100 is an apocalyptic number.
12513250315100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12513250315100 is an abundant number, since it is smaller than the sum of its proper divisors (14640502868884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12513250315100 is a wasteful number, since it uses less digits than its factorization.
12513250315100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125132503165 (or 125132503158 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 12513250315100 its reverse (151305231521), we get a palindrome (12664555546621).
The spelling of 12513250315100 in words is "twelve trillion, five hundred thirteen billion, two hundred fifty million, three hundred fifteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •