Base | Representation |
---|---|
bin | 10010101011011110… |
… | …010000110000000011 |
3 | 1220202210020020022212 |
4 | 102223132100300003 |
5 | 312034004043201 |
6 | 13114112452335 |
7 | 1310011121444 |
oct | 225336206003 |
9 | 56683206285 |
10 | 20056706051 |
11 | 8562540128 |
12 | 3a78b4a0ab |
13 | 1b78370505 |
14 | d83a472cb |
15 | 7c5c1cabb |
hex | 4ab790c03 |
20056706051 has 2 divisors, whose sum is σ = 20056706052. Its totient is φ = 20056706050.
The previous prime is 20056706017. The next prime is 20056706053. The reversal of 20056706051 is 15060765002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20056706051 - 26 = 20056705987 is a prime.
Together with 20056706053, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 20056705999 and 20056706017.
It is not a weakly prime, because it can be changed into another prime (20056706053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10028353025 + 10028353026.
It is an arithmetic number, because the mean of its divisors is an integer number (10028353026).
Almost surely, 220056706051 is an apocalyptic number.
20056706051 is a deficient number, since it is larger than the sum of its proper divisors (1).
20056706051 is an equidigital number, since it uses as much as digits as its factorization.
20056706051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 20056706051 in words is "twenty billion, fifty-six million, seven hundred six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •