Base | Representation |
---|---|
bin | 1001011000001100100101… |
… | …0111111010100100001101 |
3 | 1100111202021020002202110111 |
4 | 2112003021113322210031 |
5 | 2322420020300000023 |
6 | 33532540144240021 |
7 | 2112652424602255 |
oct | 226031127724415 |
9 | 40452236082414 |
10 | 10311300000013 |
11 | 3315aa8042601 |
12 | 11a6495610011 |
13 | 59a4750ac56c |
14 | 2790d8d14965 |
15 | 12d3496a000d |
hex | 960c95fa90d |
10311300000013 has 2 divisors, whose sum is σ = 10311300000014. Its totient is φ = 10311300000012.
The previous prime is 10311299999977. The next prime is 10311300000037. The reversal of 10311300000013 is 31000000311301.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10269634209129 + 41665790884 = 3204627^2 + 204122^2 .
It is a cyclic number.
It is not a de Polignac number, because 10311300000013 - 233 = 10302710065421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10311299999939 and 10311300000002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10311300000083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5155650000006 + 5155650000007.
It is an arithmetic number, because the mean of its divisors is an integer number (5155650000007).
Almost surely, 210311300000013 is an apocalyptic number.
It is an amenable number.
10311300000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10311300000013 is an equidigital number, since it uses as much as digits as its factorization.
10311300000013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 10311300000013 its reverse (31000000311301), we get a palindrome (41311300311314).
The spelling of 10311300000013 in words is "ten trillion, three hundred eleven billion, three hundred million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •