Base | Representation |
---|---|
bin | 1011111100010100111001… |
… | …1000100111110001111101 |
3 | 1201111022111001202022222112 |
4 | 2333011032120213301331 |
5 | 3210114322201213432 |
6 | 43532151214223405 |
7 | 2523454111156115 |
oct | 277051630476175 |
9 | 51438431668875 |
10 | 13131030101117 |
11 | 4202925192065 |
12 | 1580a6b4b4b65 |
13 | 7433350a9126 |
14 | 33578c236045 |
15 | 17b87cb757b2 |
hex | bf14e627c7d |
13131030101117 has 2 divisors, whose sum is σ = 13131030101118. Its totient is φ = 13131030101116.
The previous prime is 13131030101081. The next prime is 13131030101143. The reversal of 13131030101117 is 71110103013131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13121933901241 + 9096199876 = 3622421^2 + 95374^2 .
It is a cyclic number.
It is not a de Polignac number, because 13131030101117 - 210 = 13131030100093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13131030101092 and 13131030101101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13131030103117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565515050558 + 6565515050559.
It is an arithmetic number, because the mean of its divisors is an integer number (6565515050559).
Almost surely, 213131030101117 is an apocalyptic number.
It is an amenable number.
13131030101117 is a deficient number, since it is larger than the sum of its proper divisors (1).
13131030101117 is an equidigital number, since it uses as much as digits as its factorization.
13131030101117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 189, while the sum is 23.
Adding to 13131030101117 its reverse (71110103013131), we get a palindrome (84241133114248).
The spelling of 13131030101117 in words is "thirteen trillion, one hundred thirty-one billion, thirty million, one hundred one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •