Base | Representation |
---|---|
bin | 10010101111011000… |
… | …110111101011000001 |
3 | 1220221100211220111122 |
4 | 102233120313223001 |
5 | 312202313321343 |
6 | 13124420522025 |
7 | 1311436406336 |
oct | 225730675301 |
9 | 56840756448 |
10 | 20122401473 |
11 | 8596631069 |
12 | 3a96b50315 |
13 | 1b88b62945 |
14 | d8c66898d |
15 | 7cb898068 |
hex | 4af637ac1 |
20122401473 has 2 divisors, whose sum is σ = 20122401474. Its totient is φ = 20122401472.
The previous prime is 20122401457. The next prime is 20122401503. The reversal of 20122401473 is 37410422102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11734955584 + 8387445889 = 108328^2 + 91583^2 .
It is a cyclic number.
It is not a de Polignac number, because 20122401473 - 24 = 20122401457 is a prime.
It is a super-2 number, since 2×201224014732 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (20122401433) 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, 10061200736 + 10061200737.
It is an arithmetic number, because the mean of its divisors is an integer number (10061200737).
Almost surely, 220122401473 is an apocalyptic number.
It is an amenable number.
20122401473 is a deficient number, since it is larger than the sum of its proper divisors (1).
20122401473 is an equidigital number, since it uses as much as digits as its factorization.
20122401473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 26.
Adding to 20122401473 its reverse (37410422102), we get a palindrome (57532823575).
The spelling of 20122401473 in words is "twenty billion, one hundred twenty-two million, four hundred one thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •