Base | Representation |
---|---|
bin | 1001000110000110110011… |
… | …01101000100100011001111 |
3 | 2121211002010111011002120011 |
4 | 10203003121231010203033 |
5 | 10110144042132414132 |
6 | 110312201500334051 |
7 | 4133011632420205 |
oct | 443033155044317 |
9 | 77732114132504 |
10 | 20001020201167 |
11 | 64114265292a5 |
12 | 22b03b9244327 |
13 | b2111b774a75 |
14 | 4d20a9947075 |
15 | 24a414707b47 |
hex | 1230d9b448cf |
20001020201167 has 2 divisors, whose sum is σ = 20001020201168. Its totient is φ = 20001020201166.
The previous prime is 20001020201137. The next prime is 20001020201219. The reversal of 20001020201167 is 76110202010002.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20001020201167 - 219 = 20001019676879 is a prime.
It is a super-2 number, since 2×200010202011672 (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 (20001020201137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000510100583 + 10000510100584.
It is an arithmetic number, because the mean of its divisors is an integer number (10000510100584).
Almost surely, 220001020201167 is an apocalyptic number.
20001020201167 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001020201167 is an equidigital number, since it uses as much as digits as its factorization.
20001020201167 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 20001020201167 its reverse (76110202010002), we get a palindrome (96111222211169).
The spelling of 20001020201167 in words is "twenty trillion, one billion, twenty million, two hundred one thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •