Base | Representation |
---|---|
bin | 1001000110101100011010… |
… | …01110101011001100101101 |
3 | 2121220000020200120210210222 |
4 | 10203112031032223030231 |
5 | 10111011420233013234 |
6 | 110325341240541125 |
7 | 4134325204036406 |
oct | 443261516531455 |
9 | 77800220523728 |
10 | 20021212001069 |
11 | 6419a4824a434 |
12 | 22b42b34817a5 |
13 | b22cb8ac5466 |
14 | 4d30634b89ad |
15 | 24abe720d42e |
hex | 12358d3ab32d |
20021212001069 has 2 divisors, whose sum is σ = 20021212001070. Its totient is φ = 20021212001068.
The previous prime is 20021212000987. The next prime is 20021212001111. The reversal of 20021212001069 is 96010021212002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13048639044100 + 6972572956969 = 3612290^2 + 2640563^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20021212001069 is a prime.
It is a super-2 number, since 2×200212120010692 (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 (20021212003069) 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, 10010606000534 + 10010606000535.
It is an arithmetic number, because the mean of its divisors is an integer number (10010606000535).
Almost surely, 220021212001069 is an apocalyptic number.
It is an amenable number.
20021212001069 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021212001069 is an equidigital number, since it uses as much as digits as its factorization.
20021212001069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The spelling of 20021212001069 in words is "twenty trillion, twenty-one billion, two hundred twelve million, one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •