Base | Representation |
---|---|
bin | 10011100001000101… |
… | …110010100010000111 |
3 | 2000002110220100000211 |
4 | 103201011302202013 |
5 | 320404300313422 |
6 | 13343245220251 |
7 | 1341213163231 |
oct | 234105624207 |
9 | 60073810024 |
10 | 20956260487 |
11 | 8984298748 |
12 | 408a261687 |
13 | 1c8c83c146 |
14 | 102b2c9251 |
15 | 829bac577 |
hex | 4e1172887 |
20956260487 has 2 divisors, whose sum is σ = 20956260488. Its totient is φ = 20956260486.
The previous prime is 20956260467. The next prime is 20956260527. The reversal of 20956260487 is 78406265902.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20956260487 - 231 = 18808776839 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20956260487.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20956260467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10478130243 + 10478130244.
It is an arithmetic number, because the mean of its divisors is an integer number (10478130244).
Almost surely, 220956260487 is an apocalyptic number.
20956260487 is a deficient number, since it is larger than the sum of its proper divisors (1).
20956260487 is an equidigital number, since it uses as much as digits as its factorization.
20956260487 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1451520, while the sum is 49.
The spelling of 20956260487 in words is "twenty billion, nine hundred fifty-six million, two hundred sixty thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •