Base | Representation |
---|---|
bin | 1001001001010001110100… |
… | …01000001101100100000101 |
3 | 2122012111110022122210100102 |
4 | 10210220322020031210011 |
5 | 10113440301100023414 |
6 | 110434224555253445 |
7 | 4143620563363454 |
oct | 444507210154405 |
9 | 78174408583312 |
10 | 20110012111109 |
11 | 645367662a428 |
12 | 230955644a285 |
13 | b2b49b16137b |
14 | 4d7488cb4b9b |
15 | 24d193071ede |
hex | 124a3a20d905 |
20110012111109 has 2 divisors, whose sum is σ = 20110012111110. Its totient is φ = 20110012111108.
The previous prime is 20110012111081. The next prime is 20110012111141. The reversal of 20110012111109 is 90111121001102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15869307976900 + 4240704134209 = 3983630^2 + 2059297^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110012111109 - 212 = 20110012107013 is a prime.
It is a super-2 number, since 2×201100121111092 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110012111169) 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, 10055006055554 + 10055006055555.
It is an arithmetic number, because the mean of its divisors is an integer number (10055006055555).
Almost surely, 220110012111109 is an apocalyptic number.
It is an amenable number.
20110012111109 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110012111109 is an equidigital number, since it uses as much as digits as its factorization.
20110012111109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 20110012111109 in words is "twenty trillion, one hundred ten billion, twelve million, one hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •