Base | Representation |
---|---|
bin | 1001001100100010011111… |
… | …1000101111100100101011 |
3 | 1022210121022112002102112121 |
4 | 2103020213320233210223 |
5 | 2311124333140414011 |
6 | 33300534532052111 |
7 | 2062332361443055 |
oct | 223104770574453 |
9 | 38717275072477 |
10 | 10111022201131 |
11 | 3249073490a55 |
12 | 1173700a64037 |
13 | 584608366867 |
14 | 26d539d9c8d5 |
15 | 128026b54e71 |
hex | 93227e2f92b |
10111022201131 has 2 divisors, whose sum is σ = 10111022201132. Its totient is φ = 10111022201130.
The previous prime is 10111022201129. The next prime is 10111022201141. The reversal of 10111022201131 is 13110222011101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10111022201131 - 21 = 10111022201129 is a prime.
It is a super-2 number, since 2×101110222011312 (a number of 27 digits) contains 22 as substring.
Together with 10111022201129, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10111022201141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055511100565 + 5055511100566.
It is an arithmetic number, because the mean of its divisors is an integer number (5055511100566).
Almost surely, 210111022201131 is an apocalyptic number.
10111022201131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111022201131 is an equidigital number, since it uses as much as digits as its factorization.
10111022201131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 10111022201131 its reverse (13110222011101), we get a palindrome (23221244212232).
The spelling of 10111022201131 in words is "ten trillion, one hundred eleven billion, twenty-two million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •