Base | Representation |
---|---|
bin | 1001001000111111001101… |
… | …01011011000011110110011 |
3 | 2122011112200002201011022012 |
4 | 10210133212223120132303 |
5 | 10113304321130011011 |
6 | 110425453411033135 |
7 | 4143115166645255 |
oct | 444374653303663 |
9 | 78145602634265 |
10 | 20100022110131 |
11 | 644a40a524877 |
12 | 230762889b7ab |
13 | b2a5685651a2 |
14 | 4d6bbc1d5cd5 |
15 | 24ccaaedba8b |
hex | 1247e6ad87b3 |
20100022110131 has 2 divisors, whose sum is σ = 20100022110132. Its totient is φ = 20100022110130.
The previous prime is 20100022110053. The next prime is 20100022110149. The reversal of 20100022110131 is 13101122000102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20100022110131 - 242 = 15701975599027 is a prime.
It is a super-2 number, since 2×201000221101312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20100022130131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050011055065 + 10050011055066.
It is an arithmetic number, because the mean of its divisors is an integer number (10050011055066).
Almost surely, 220100022110131 is an apocalyptic number.
20100022110131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100022110131 is an equidigital number, since it uses as much as digits as its factorization.
20100022110131 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 14.
Adding to 20100022110131 its reverse (13101122000102), we get a palindrome (33201144110233).
The spelling of 20100022110131 in words is "twenty trillion, one hundred billion, twenty-two million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •