Base | Representation |
---|---|
bin | 10011000100001000001… |
… | …011110001101011111111 |
3 | 11122020121021122222212122 |
4 | 103010020023301223333 |
5 | 132431042144030421 |
6 | 2441504103353155 |
7 | 163436362032011 |
oct | 23041013615377 |
9 | 4566537588778 |
10 | 1310102330111 |
11 | 46567a67a343 |
12 | 191aa67527bb |
13 | 96708062b73 |
14 | 475a31481b1 |
15 | 2412ac982ab |
hex | 131082f1aff |
1310102330111 has 2 divisors, whose sum is σ = 1310102330112. Its totient is φ = 1310102330110.
The previous prime is 1310102330087. The next prime is 1310102330143. The reversal of 1310102330111 is 1110332010131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1310102330111 - 222 = 1310098135807 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1310102330111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310102330311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655051165055 + 655051165056.
It is an arithmetic number, because the mean of its divisors is an integer number (655051165056).
Almost surely, 21310102330111 is an apocalyptic number.
1310102330111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310102330111 is an equidigital number, since it uses as much as digits as its factorization.
1310102330111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1310102330111 its reverse (1110332010131), we get a palindrome (2420434340242).
The spelling of 1310102330111 in words is "one trillion, three hundred ten billion, one hundred two million, three hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •