Base | Representation |
---|---|
bin | 10010101111100111… |
… | …011010011111011101 |
3 | 1220221122000121110101 |
4 | 102233213122133131 |
5 | 312204302322414 |
6 | 13125034341101 |
7 | 1311513666031 |
oct | 225747323735 |
9 | 56848017411 |
10 | 20126214109 |
11 | 85987a5601 |
12 | 3a9828a791 |
13 | 1b89899141 |
14 | d8cd7c1c1 |
15 | 7cbd9ca74 |
hex | 4af9da7dd |
20126214109 has 2 divisors, whose sum is σ = 20126214110. Its totient is φ = 20126214108.
The previous prime is 20126214091. The next prime is 20126214131. The reversal of 20126214109 is 90141262102.
Together with previous prime (20126214091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18379224900 + 1746989209 = 135570^2 + 41797^2 .
It is a cyclic number.
It is not a de Polignac number, because 20126214109 - 217 = 20126083037 is a prime.
It is a super-2 number, since 2×201262141092 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20126214169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10063107054 + 10063107055.
It is an arithmetic number, because the mean of its divisors is an integer number (10063107055).
Almost surely, 220126214109 is an apocalyptic number.
It is an amenable number.
20126214109 is a deficient number, since it is larger than the sum of its proper divisors (1).
20126214109 is an equidigital number, since it uses as much as digits as its factorization.
20126214109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 20126214109 in words is "twenty billion, one hundred twenty-six million, two hundred fourteen thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •