Base | Representation |
---|---|
bin | 10010110111101110… |
… | …00111100011011111 |
3 | 222011001110201101102 |
4 | 21123313013203133 |
5 | 131222031010421 |
6 | 4353144503315 |
7 | 506026005113 |
oct | 113367074337 |
9 | 28131421342 |
10 | 10131110111 |
11 | 4329824a81 |
12 | 1b68a7ab3b |
13 | c55c04315 |
14 | 6c1731743 |
15 | 3e465a60b |
hex | 25bdc78df |
10131110111 has 2 divisors, whose sum is σ = 10131110112. Its totient is φ = 10131110110.
The previous prime is 10131110063. The next prime is 10131110117. The reversal of 10131110111 is 11101113101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10131110111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10131110092 and 10131110101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10131110117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065555055 + 5065555056.
It is an arithmetic number, because the mean of its divisors is an integer number (5065555056).
Almost surely, 210131110111 is an apocalyptic number.
10131110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10131110111 is an equidigital number, since it uses as much as digits as its factorization.
10131110111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 10131110111 its reverse (11101113101), we get a palindrome (21232223212).
The spelling of 10131110111 in words is "ten billion, one hundred thirty-one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •