Base | Representation |
---|---|
bin | 1001010010011000110101… |
… | …00001010110100011010001 |
3 | 2200022102100222202201121101 |
4 | 10221030122201112203101 |
5 | 10134102313144140332 |
6 | 111234111525424401 |
7 | 4205341223325661 |
oct | 451143241264321 |
9 | 80272328681541 |
10 | 20423014443217 |
11 | 6564396254241 |
12 | 235a14a26b101 |
13 | b51b6099a2c9 |
14 | 50869cbcc1a1 |
15 | 2563b1e93ae7 |
hex | 12931a8568d1 |
20423014443217 has 2 divisors, whose sum is σ = 20423014443218. Its totient is φ = 20423014443216.
The previous prime is 20423014443163. The next prime is 20423014443233. The reversal of 20423014443217 is 71234441032402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20390426611776 + 32587831441 = 4515576^2 + 180521^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20423014443217 is a prime.
It is not a weakly prime, because it can be changed into another prime (20423014443287) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10211507221608 + 10211507221609.
It is an arithmetic number, because the mean of its divisors is an integer number (10211507221609).
Almost surely, 220423014443217 is an apocalyptic number.
It is an amenable number.
20423014443217 is a deficient number, since it is larger than the sum of its proper divisors (1).
20423014443217 is an equidigital number, since it uses as much as digits as its factorization.
20423014443217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129024, while the sum is 37.
Adding to 20423014443217 its reverse (71234441032402), we get a palindrome (91657455475619).
The spelling of 20423014443217 in words is "twenty trillion, four hundred twenty-three billion, fourteen million, four hundred forty-three thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •