Base | Representation |
---|---|
bin | 10010101110101001… |
… | …100110111001101001 |
3 | 1220220111112110100121 |
4 | 102232221212321221 |
5 | 312141130341014 |
6 | 13123255203241 |
7 | 1311226165423 |
oct | 225651467151 |
9 | 56814473317 |
10 | 20110012009 |
11 | 858a63973a |
12 | 3a92976521 |
13 | 1b864155b9 |
14 | d8ab61813 |
15 | 7ca74c124 |
hex | 4aea66e69 |
20110012009 has 2 divisors, whose sum is σ = 20110012010. Its totient is φ = 20110012008.
The previous prime is 20110011941. The next prime is 20110012037. The reversal of 20110012009 is 90021001102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18273632400 + 1836379609 = 135180^2 + 42853^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110012009 - 29 = 20110011497 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20110011983 and 20110012001.
It is not a weakly prime, because it can be changed into another prime (20110012099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055006004 + 10055006005.
It is an arithmetic number, because the mean of its divisors is an integer number (10055006005).
Almost surely, 220110012009 is an apocalyptic number.
It is an amenable number.
20110012009 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110012009 is an equidigital number, since it uses as much as digits as its factorization.
20110012009 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 16.
The spelling of 20110012009 in words is "twenty billion, one hundred ten million, twelve thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •