Base | Representation |
---|---|
bin | 1001000110001110011011… |
… | …00011111001011110100001 |
3 | 2121211110200121112102100021 |
4 | 10203013031203321132201 |
5 | 10110230432011442332 |
6 | 110314115445553441 |
7 | 4133215211355124 |
oct | 443071543713641 |
9 | 77743617472307 |
10 | 20005111437217 |
11 | 6413135968515 |
12 | 22b115b415881 |
13 | b2162125bbba |
14 | 4d237704a3bb |
15 | 24a5a39a0c97 |
hex | 1231cd8f97a1 |
20005111437217 has 2 divisors, whose sum is σ = 20005111437218. Its totient is φ = 20005111437216.
The previous prime is 20005111437163. The next prime is 20005111437257. The reversal of 20005111437217 is 71273411150002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18493775592721 + 1511335844496 = 4300439^2 + 1229364^2 .
It is a cyclic number.
It is not a de Polignac number, because 20005111437217 - 227 = 20004977219489 is a prime.
It is not a weakly prime, because it can be changed into another prime (20005111437257) 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, 10002555718608 + 10002555718609.
It is an arithmetic number, because the mean of its divisors is an integer number (10002555718609).
Almost surely, 220005111437217 is an apocalyptic number.
It is an amenable number.
20005111437217 is a deficient number, since it is larger than the sum of its proper divisors (1).
20005111437217 is an equidigital number, since it uses as much as digits as its factorization.
20005111437217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11760, while the sum is 34.
Adding to 20005111437217 its reverse (71273411150002), we get a palindrome (91278522587219).
The spelling of 20005111437217 in words is "twenty trillion, five billion, one hundred eleven million, four hundred thirty-seven thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •