Base | Representation |
---|---|
bin | 10011000001011011… |
… | …001110110110001001 |
3 | 1221201110021001010221 |
4 | 103001123032312021 |
5 | 313312300314234 |
6 | 13214430510041 |
7 | 1322102503525 |
oct | 230133166611 |
9 | 57643231127 |
10 | 20425010569 |
11 | 8731427827 |
12 | 3b60365321 |
13 | 1c06765192 |
14 | dba91ad85 |
15 | 7e821eeb4 |
hex | 4c16ced89 |
20425010569 has 2 divisors, whose sum is σ = 20425010570. Its totient is φ = 20425010568.
The previous prime is 20425010539. The next prime is 20425010603. The reversal of 20425010569 is 96501052402.
It is a happy number.
It is an a-pointer prime, because the next prime (20425010603) can be obtained adding 20425010569 to its sum of digits (34).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20324208969 + 100801600 = 142563^2 + 10040^2 .
It is a cyclic number.
It is not a de Polignac number, because 20425010569 - 223 = 20416621961 is a prime.
It is a super-2 number, since 2×204250105692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20425010539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10212505284 + 10212505285.
It is an arithmetic number, because the mean of its divisors is an integer number (10212505285).
Almost surely, 220425010569 is an apocalyptic number.
It is an amenable number.
20425010569 is a deficient number, since it is larger than the sum of its proper divisors (1).
20425010569 is an equidigital number, since it uses as much as digits as its factorization.
20425010569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 34.
The spelling of 20425010569 in words is "twenty billion, four hundred twenty-five million, ten thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •