Base | Representation |
---|---|
bin | 1011111010100110001001… |
… | …1101010101101100111111 |
3 | 1201101110202021021222001222 |
4 | 2332221202131111230333 |
5 | 3204122431320023124 |
6 | 43510353300223555 |
7 | 2521352323342112 |
oct | 276514235255477 |
9 | 51343667258058 |
10 | 13101302111039 |
11 | 41a125a54511a |
12 | 157715369abbb |
13 | 7405a819195c |
14 | 33416bd96579 |
15 | 17abdcd7c25e |
hex | bea62755b3f |
13101302111039 has 2 divisors, whose sum is σ = 13101302111040. Its totient is φ = 13101302111038.
The previous prime is 13101302110993. The next prime is 13101302111041. The reversal of 13101302111039 is 93011120310131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13101302111039 - 212 = 13101302106943 is a prime.
Together with 13101302111041, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13101302110999 and 13101302111017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13101302101039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550651055519 + 6550651055520.
It is an arithmetic number, because the mean of its divisors is an integer number (6550651055520).
Almost surely, 213101302111039 is an apocalyptic number.
13101302111039 is a deficient number, since it is larger than the sum of its proper divisors (1).
13101302111039 is an equidigital number, since it uses as much as digits as its factorization.
13101302111039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 26.
The spelling of 13101302111039 in words is "thirteen trillion, one hundred one billion, three hundred two million, one hundred eleven thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •