Base | Representation |
---|---|
bin | 1001000110000110110010… |
… | …01101110101000100111111 |
3 | 2121211002002220202000012202 |
4 | 10203003121031311010333 |
5 | 10110144033033330302 |
6 | 110312201005022115 |
7 | 4133011503000134 |
oct | 443033115650477 |
9 | 77732086660182 |
10 | 20001012011327 |
11 | 6411421945136 |
12 | 22b03b655493b |
13 | b21119b680c9 |
14 | 4d20a881458b |
15 | 24a413b3b202 |
hex | 1230d937513f |
20001012011327 has 2 divisors, whose sum is σ = 20001012011328. Its totient is φ = 20001012011326.
The previous prime is 20001012011173. The next prime is 20001012011329. The reversal of 20001012011327 is 72311021010002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20001012011327 - 210 = 20001012010303 is a prime.
Together with 20001012011329, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 20001012011299 and 20001012011308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20001012011329) 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, 10000506005663 + 10000506005664.
It is an arithmetic number, because the mean of its divisors is an integer number (10000506005664).
Almost surely, 220001012011327 is an apocalyptic number.
20001012011327 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001012011327 is an equidigital number, since it uses as much as digits as its factorization.
20001012011327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 20001012011327 its reverse (72311021010002), we get a palindrome (92312033021329).
The spelling of 20001012011327 in words is "twenty trillion, one billion, twelve million, eleven thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •