Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …1011110111111100010111 |
3 | 1022210121112201101001220221 |
4 | 2103020231023313330113 |
5 | 2311130023420232411 |
6 | 33300551425335211 |
7 | 2062334521210666 |
oct | 223105513677427 |
9 | 38717481331827 |
10 | 10111111102231 |
11 | 3249109691737 |
12 | 1173726797507 |
13 | 5846208c2569 |
14 | 26d547b00ddd |
15 | 12802e866071 |
hex | 9322d2f7f17 |
10111111102231 has 2 divisors, whose sum is σ = 10111111102232. Its totient is φ = 10111111102230.
The previous prime is 10111111102097. The next prime is 10111111102247. The reversal of 10111111102231 is 13220111111101.
It is an a-pointer prime, because the next prime (10111111102247) can be obtained adding 10111111102231 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10111111102231 - 211 = 10111111100183 is a prime.
It is a super-2 number, since 2×101111111022312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111111102931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055555551115 + 5055555551116.
It is an arithmetic number, because the mean of its divisors is an integer number (5055555551116).
Almost surely, 210111111102231 is an apocalyptic number.
10111111102231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111111102231 is an equidigital number, since it uses as much as digits as its factorization.
10111111102231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 16.
Adding to 10111111102231 its reverse (13220111111101), we get a palindrome (23331222213332).
The spelling of 10111111102231 in words is "ten trillion, one hundred eleven billion, one hundred eleven million, one hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •