Base | Representation |
---|---|
bin | 1001011000001100010000… |
… | …0100110101001011000111 |
3 | 1100111202001000211201210221 |
4 | 2112003010010311023013 |
5 | 2322414330021023421 |
6 | 33532523251125211 |
7 | 2112650265215041 |
oct | 226030404651307 |
9 | 40452030751727 |
10 | 10311211111111 |
11 | 3315a6194aaa9 |
12 | 11a646b8a3807 |
13 | 59a45c859291 |
14 | 2790cb1b6a91 |
15 | 12d341992841 |
hex | 960c41352c7 |
10311211111111 has 2 divisors, whose sum is σ = 10311211111112. Its totient is φ = 10311211111110.
The previous prime is 10311211111051. The next prime is 10311211111127. The reversal of 10311211111111 is 11111111211301.
It is an a-pointer prime, because the next prime (10311211111127) can be obtained adding 10311211111111 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10311211111111 is a prime.
10311211111111 is a modest number, since divided by 1111111 gives 1031121 as remainder.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10311211111151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5155605555555 + 5155605555556.
It is an arithmetic number, because the mean of its divisors is an integer number (5155605555556).
Almost surely, 210311211111111 is an apocalyptic number.
10311211111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10311211111111 is an equidigital number, since it uses as much as digits as its factorization.
10311211111111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 16.
Adding to 10311211111111 its reverse (11111111211301), we get a palindrome (21422322322412).
The spelling of 10311211111111 in words is "ten trillion, three hundred eleven billion, two hundred eleven million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •