Base | Representation |
---|---|
bin | 1001001000111111100101… |
… | …00010100000101101000111 |
3 | 2122011120011222011110022212 |
4 | 10210133302202200231013 |
5 | 10113310223101023421 |
6 | 110425525240214035 |
7 | 4143123134302121 |
oct | 444376242405507 |
9 | 78146158143285 |
10 | 20100221111111 |
11 | 644a501895199 |
12 | 230768346a31b |
13 | b2a59a85c84b |
14 | 4d6bda7d8211 |
15 | 24ccbd6e9e5b |
hex | 1247f28a0b47 |
20100221111111 has 4 divisors (see below), whose sum is σ = 21158127485400. Its totient is φ = 19042314736824.
The previous prime is 20100221111101. The next prime is 20100221111123. The reversal of 20100221111111 is 11111112200102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20100221111111 - 210 = 20100221110087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100221111101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 528953187116 + ... + 528953187153.
It is an arithmetic number, because the mean of its divisors is an integer number (5289531871350).
Almost surely, 220100221111111 is an apocalyptic number.
20100221111111 is a deficient number, since it is larger than the sum of its proper divisors (1057906374289).
20100221111111 is a wasteful number, since it uses less digits than its factorization.
20100221111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1057906374288.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 20100221111111 its reverse (11111112200102), we get a palindrome (31211333311213).
The spelling of 20100221111111 in words is "twenty trillion, one hundred billion, two hundred twenty-one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •