Base | Representation |
---|---|
bin | 1001001011111101001010… |
… | …01010100101110100010101 |
3 | 2122112021220021021000000122 |
4 | 10211332211022211310111 |
5 | 10121442200031210234 |
6 | 110544401030321325 |
7 | 4153355306334011 |
oct | 445764512456425 |
9 | 78467807230018 |
10 | 20202002210069 |
11 | 64896916452a9 |
12 | 23233497b9245 |
13 | b3706b3721a4 |
14 | 4dbad4211541 |
15 | 250778ea792e |
hex | 125fa52a5d15 |
20202002210069 has 2 divisors, whose sum is σ = 20202002210070. Its totient is φ = 20202002210068.
The previous prime is 20202002210041. The next prime is 20202002210153. The reversal of 20202002210069 is 96001220020202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18357471531844 + 1844530678225 = 4284562^2 + 1358135^2 .
It is a cyclic number.
It is not a de Polignac number, because 20202002210069 - 228 = 20201733774613 is a prime.
It is a super-2 number, since 2×202020022100692 (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 (20202002212069) 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, 10101001105034 + 10101001105035.
It is an arithmetic number, because the mean of its divisors is an integer number (10101001105035).
Almost surely, 220202002210069 is an apocalyptic number.
It is an amenable number.
20202002210069 is a deficient number, since it is larger than the sum of its proper divisors (1).
20202002210069 is an equidigital number, since it uses as much as digits as its factorization.
20202002210069 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 26.
The spelling of 20202002210069 in words is "twenty trillion, two hundred two billion, two million, two hundred ten thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •