Base | Representation |
---|---|
bin | 10011100001010010… |
… | …000001001000000011 |
3 | 2000002200221012011001 |
4 | 103201102001020003 |
5 | 320411110402422 |
6 | 13343442032431 |
7 | 1341252343555 |
oct | 234122011003 |
9 | 60080835131 |
10 | 20959465987 |
11 | 8986088019 |
12 | 408b348717 |
13 | 1c903c21a5 |
14 | 102b8c14d5 |
15 | 82a0e2227 |
hex | 4e1481203 |
20959465987 has 2 divisors, whose sum is σ = 20959465988. Its totient is φ = 20959465986.
The previous prime is 20959465951. The next prime is 20959465997. The reversal of 20959465987 is 78956495902.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20959465987 - 27 = 20959465859 is a prime.
It is not a weakly prime, because it can be changed into another prime (20959465907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10479732993 + 10479732994.
It is an arithmetic number, because the mean of its divisors is an integer number (10479732994).
Almost surely, 220959465987 is an apocalyptic number.
20959465987 is a deficient number, since it is larger than the sum of its proper divisors (1).
20959465987 is an equidigital number, since it uses as much as digits as its factorization.
20959465987 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48988800, while the sum is 64.
The spelling of 20959465987 in words is "twenty billion, nine hundred fifty-nine million, four hundred sixty-five thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •