Base | Representation |
---|---|
bin | 1001001001101000010101… |
… | …01000101100100001110101 |
3 | 2122020122122202120110012202 |
4 | 10210310022220230201311 |
5 | 10114140030124101234 |
6 | 110443544253354245 |
7 | 4144526254544456 |
oct | 444641250544165 |
9 | 78218582513182 |
10 | 20122100222069 |
11 | 6458809aa207a |
12 | 230b96a798985 |
13 | b2c676636051 |
14 | 4d7cb44ab12d |
15 | 24d64e3e977e |
hex | 124d0aa2c875 |
20122100222069 has 2 divisors, whose sum is σ = 20122100222070. Its totient is φ = 20122100222068.
The previous prime is 20122100222027. The next prime is 20122100222137. The reversal of 20122100222069 is 96022200122102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12210565787044 + 7911534435025 = 3494362^2 + 2812745^2 .
It is a cyclic number.
It is not a de Polignac number, because 20122100222069 - 216 = 20122100156533 is a prime.
It is a super-2 number, since 2×201221002220692 (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 (20122100222009) 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, 10061050111034 + 10061050111035.
It is an arithmetic number, because the mean of its divisors is an integer number (10061050111035).
Almost surely, 220122100222069 is an apocalyptic number.
It is an amenable number.
20122100222069 is a deficient number, since it is larger than the sum of its proper divisors (1).
20122100222069 is an equidigital number, since it uses as much as digits as its factorization.
20122100222069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
The spelling of 20122100222069 in words is "twenty trillion, one hundred twenty-two billion, one hundred million, two hundred twenty-two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •