Base | Representation |
---|---|
bin | 10010101000000110… |
… | …010111101001110101 |
3 | 1220121211201220211001 |
4 | 102220012113221311 |
5 | 311430012024341 |
6 | 13104331443301 |
7 | 1305423066106 |
oct | 225006275165 |
9 | 56554656731 |
10 | 20000111221 |
11 | 85335a5642 |
12 | 3a61bb6531 |
13 | 1b6971644c |
14 | d7a3143ad |
15 | 7c0c8dd31 |
hex | 4a8197a75 |
20000111221 has 2 divisors, whose sum is σ = 20000111222. Its totient is φ = 20000111220.
The previous prime is 20000111191. The next prime is 20000111237. The reversal of 20000111221 is 12211100002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19912314321 + 87796900 = 141111^2 + 9370^2 .
It is a cyclic number.
It is not a de Polignac number, because 20000111221 - 215 = 20000078453 is a prime.
It is a super-2 number, since 2×200001112212 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20000111198 and 20000111207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20000111291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000055610 + 10000055611.
It is an arithmetic number, because the mean of its divisors is an integer number (10000055611).
Almost surely, 220000111221 is an apocalyptic number.
It is an amenable number.
20000111221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20000111221 is an equidigital number, since it uses as much as digits as its factorization.
20000111221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20000111221 its reverse (12211100002), we get a palindrome (32211211223).
The spelling of 20000111221 in words is "twenty billion, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •