Base | Representation |
---|---|
bin | 1001001100010000001011… |
… | …01101110110110011101101 |
3 | 2122120021020210210011121121 |
4 | 10212020011231312303231 |
5 | 10122124102233031104 |
6 | 110553210105500541 |
7 | 4154166312205225 |
oct | 446100555666355 |
9 | 78507223704547 |
10 | 20212212002029 |
11 | 6492a508200a3 |
12 | 2325318aa1751 |
13 | b380076648c8 |
14 | 4dc3c2185085 |
15 | 250b754a6254 |
hex | 126205b76ced |
20212212002029 has 2 divisors, whose sum is σ = 20212212002030. Its totient is φ = 20212212002028.
The previous prime is 20212212001999. The next prime is 20212212002039. The reversal of 20212212002029 is 92020021221202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12921796196100 + 7290415805929 = 3594690^2 + 2700077^2 .
It is a cyclic number.
It is not a de Polignac number, because 20212212002029 - 229 = 20211675131117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20212212001994 and 20212212002012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20212212002039) 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, 10106106001014 + 10106106001015.
It is an arithmetic number, because the mean of its divisors is an integer number (10106106001015).
Almost surely, 220212212002029 is an apocalyptic number.
It is an amenable number.
20212212002029 is a deficient number, since it is larger than the sum of its proper divisors (1).
20212212002029 is an equidigital number, since it uses as much as digits as its factorization.
20212212002029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
The spelling of 20212212002029 in words is "twenty trillion, two hundred twelve billion, two hundred twelve million, two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •