Base | Representation |
---|---|
bin | 1011111011101111100100… |
… | …1001000011101011001101 |
3 | 1201110100121202012122000112 |
4 | 2332323321021003223031 |
5 | 3204433312031214432 |
6 | 43523413033205405 |
7 | 2522650601001533 |
oct | 276737111035315 |
9 | 51410552178015 |
10 | 13121010023117 |
11 | 41a9653104167 |
12 | 157ab33860865 |
13 | 7423c91abba9 |
14 | 3350bb568153 |
15 | 17b49314d7b2 |
hex | beef9243acd |
13121010023117 has 2 divisors, whose sum is σ = 13121010023118. Its totient is φ = 13121010023116.
The previous prime is 13121010023021. The next prime is 13121010023137. The reversal of 13121010023117 is 71132001012131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8817401686921 + 4303608336196 = 2969411^2 + 2074514^2 .
It is a cyclic number.
It is not a de Polignac number, because 13121010023117 - 226 = 13120942914253 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13121010023092 and 13121010023101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13121010023137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6560505011558 + 6560505011559.
It is an arithmetic number, because the mean of its divisors is an integer number (6560505011559).
Almost surely, 213121010023117 is an apocalyptic number.
It is an amenable number.
13121010023117 is a deficient number, since it is larger than the sum of its proper divisors (1).
13121010023117 is an equidigital number, since it uses as much as digits as its factorization.
13121010023117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 23.
Adding to 13121010023117 its reverse (71132001012131), we get a palindrome (84253011035248).
The spelling of 13121010023117 in words is "thirteen trillion, one hundred twenty-one billion, ten million, twenty-three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •