Base | Representation |
---|---|
bin | 1001001100100010110111… |
… | …0110001101111001110111 |
3 | 1022210121120111021000021001 |
4 | 2103020231312031321313 |
5 | 2311130034240432411 |
6 | 33300552503304131 |
7 | 2062335014441341 |
oct | 223105566157167 |
9 | 38717514230231 |
10 | 10111122202231 |
11 | 3249114983296 |
12 | 117372a44b047 |
13 | 584622caa9cb |
14 | 26d549390291 |
15 | 128030809dc1 |
hex | 9322dd8de77 |
10111122202231 has 2 divisors, whose sum is σ = 10111122202232. Its totient is φ = 10111122202230.
The previous prime is 10111122202229. The next prime is 10111122202253. The reversal of 10111122202231 is 13220222111101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10111122202231 - 21 = 10111122202229 is a prime.
It is a super-2 number, since 2×101111222022312 (a number of 27 digits) contains 22 as substring.
Together with 10111122202229, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10111122202199 and 10111122202208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111122262231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055561101115 + 5055561101116.
It is an arithmetic number, because the mean of its divisors is an integer number (5055561101116).
Almost surely, 210111122202231 is an apocalyptic number.
10111122202231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111122202231 is an equidigital number, since it uses as much as digits as its factorization.
10111122202231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 10111122202231 its reverse (13220222111101), we get a palindrome (23331344313332).
The spelling of 10111122202231 in words is "ten trillion, one hundred eleven billion, one hundred twenty-two million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •