Base | Representation |
---|---|
bin | 10010101001010110… |
… | …101110110100110101 |
3 | 1220200022101012112021 |
4 | 102221112232310311 |
5 | 312000410141103 |
6 | 13110403153141 |
7 | 1306100126221 |
oct | 225126566465 |
9 | 56608335467 |
10 | 20021177653 |
11 | 8544484114 |
12 | 3a690757b1 |
13 | 1b70bb10a9 |
14 | d7d039781 |
15 | 7c2a50bbd |
hex | 4a95aed35 |
20021177653 has 2 divisors, whose sum is σ = 20021177654. Its totient is φ = 20021177652.
The previous prime is 20021177651. The next prime is 20021177663. The reversal of 20021177653 is 35677112002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19200813489 + 820364164 = 138567^2 + 28642^2 .
It is a cyclic number.
It is not a de Polignac number, because 20021177653 - 21 = 20021177651 is a prime.
It is a super-2 number, since 2×200211776532 (a number of 21 digits) contains 22 as substring.
Together with 20021177651, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20021177651) 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, 10010588826 + 10010588827.
It is an arithmetic number, because the mean of its divisors is an integer number (10010588827).
Almost surely, 220021177653 is an apocalyptic number.
It is an amenable number.
20021177653 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021177653 is an equidigital number, since it uses as much as digits as its factorization.
20021177653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17640, while the sum is 34.
Adding to 20021177653 its reverse (35677112002), we get a palindrome (55698289655).
The spelling of 20021177653 in words is "twenty billion, twenty-one million, one hundred seventy-seven thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •