Base | Representation |
---|---|
bin | 1001000111000010110000… |
… | …10111011100100111010111 |
3 | 2121221011012211221211000202 |
4 | 10203201120113130213113 |
5 | 10111211003230310241 |
6 | 110335043555531115 |
7 | 4135231422321446 |
oct | 443413027344727 |
9 | 77834184854022 |
10 | 20033210010071 |
11 | 6424044871155 |
12 | 22b66a15b9a9b |
13 | b2417b71097b |
14 | 4d3880b38d5d |
15 | 24b19a6d8d9b |
hex | 1238585dc9d7 |
20033210010071 has 2 divisors, whose sum is σ = 20033210010072. Its totient is φ = 20033210010070.
The previous prime is 20033210009993. The next prime is 20033210010089. The reversal of 20033210010071 is 17001001233002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20033210010071 - 226 = 20033142901207 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20033210010371) 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, 10016605005035 + 10016605005036.
It is an arithmetic number, because the mean of its divisors is an integer number (10016605005036).
Almost surely, 220033210010071 is an apocalyptic number.
20033210010071 is a deficient number, since it is larger than the sum of its proper divisors (1).
20033210010071 is an equidigital number, since it uses as much as digits as its factorization.
20033210010071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 20.
Adding to 20033210010071 its reverse (17001001233002), we get a palindrome (37034211243073).
The spelling of 20033210010071 in words is "twenty trillion, thirty-three billion, two hundred ten million, ten thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •