Base | Representation |
---|---|
bin | 1001001000111111100101… |
… | …00010100000101100111101 |
3 | 2122011120011222011110022111 |
4 | 10210133302202200230331 |
5 | 10113310223101023401 |
6 | 110425525240214021 |
7 | 4143123134302105 |
oct | 444376242405475 |
9 | 78146158143274 |
10 | 20100221111101 |
11 | 644a50189518a |
12 | 230768346a311 |
13 | b2a59a85c841 |
14 | 4d6bda7d8205 |
15 | 24ccbd6e9e51 |
hex | 1247f28a0b3d |
20100221111101 has 2 divisors, whose sum is σ = 20100221111102. Its totient is φ = 20100221111100.
The previous prime is 20100221111099. The next prime is 20100221111123. The reversal of 20100221111101 is 10111112200102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11600086692100 + 8500134419001 = 3405890^2 + 2915499^2 .
It is a cyclic number.
It is not a de Polignac number, because 20100221111101 - 21 = 20100221111099 is a prime.
Together with 20100221111099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20100221111401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050110555550 + 10050110555551.
It is an arithmetic number, because the mean of its divisors is an integer number (10050110555551).
Almost surely, 220100221111101 is an apocalyptic number.
It is an amenable number.
20100221111101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100221111101 is an equidigital number, since it uses as much as digits as its factorization.
20100221111101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20100221111101 its reverse (10111112200102), we get a palindrome (30211333311203).
The spelling of 20100221111101 in words is "twenty trillion, one hundred billion, two hundred twenty-one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •