Base | Representation |
---|---|
bin | 1001001000111111100010… |
… | …11010010111110001000011 |
3 | 2122011120010122120200100012 |
4 | 10210133301122113301003 |
5 | 10113310203230401011 |
6 | 110425523323015135 |
7 | 4143122514460064 |
oct | 444376132276103 |
9 | 78146118520305 |
10 | 20100202200131 |
11 | 644a4a2149089 |
12 | 230767906a4ab |
13 | b2a59696b011 |
14 | 4d6bd80b456b |
15 | 24ccbbc11a8b |
hex | 1247f1697c43 |
20100202200131 has 2 divisors, whose sum is σ = 20100202200132. Its totient is φ = 20100202200130.
The previous prime is 20100202200017. The next prime is 20100202200161. The reversal of 20100202200131 is 13100220200102.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20100202200131 is a prime.
It is a super-2 number, since 2×201002022001312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (20100202200161) 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, 10050101100065 + 10050101100066.
It is an arithmetic number, because the mean of its divisors is an integer number (10050101100066).
Almost surely, 220100202200131 is an apocalyptic number.
20100202200131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100202200131 is an equidigital number, since it uses as much as digits as its factorization.
20100202200131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 20100202200131 its reverse (13100220200102), we get a palindrome (33200422400233).
The spelling of 20100202200131 in words is "twenty trillion, one hundred billion, two hundred two million, two hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •