Base | Representation |
---|---|
bin | 10010101000001010… |
… | …100100001100001011 |
3 | 1220121220210210122001 |
4 | 102220022210030023 |
5 | 311430302224042 |
6 | 13104411211431 |
7 | 1305435326641 |
oct | 225012441413 |
9 | 56556723561 |
10 | 20001211147 |
11 | 8534186a75 |
12 | 3a62446b77 |
13 | 1b69a0cca8 |
14 | d7a51d191 |
15 | 7c0e09bb7 |
hex | 4a82a430b |
20001211147 has 2 divisors, whose sum is σ = 20001211148. Its totient is φ = 20001211146.
The previous prime is 20001211133. The next prime is 20001211157. The reversal of 20001211147 is 74111210002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20001211147 - 27 = 20001211019 is a prime.
It is not a weakly prime, because it can be changed into another prime (20001211157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000605573 + 10000605574.
It is an arithmetic number, because the mean of its divisors is an integer number (10000605574).
Almost surely, 220001211147 is an apocalyptic number.
20001211147 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001211147 is an equidigital number, since it uses as much as digits as its factorization.
20001211147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 19.
Adding to 20001211147 its reverse (74111210002), we get a palindrome (94112421149).
The spelling of 20001211147 in words is "twenty billion, one million, two hundred eleven thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •