Base | Representation |
---|---|
bin | 1001001100001110001000… |
… | …00010011100010000111101 |
3 | 2122120011102000100212001021 |
4 | 10212013010002130100331 |
5 | 10122114323141231302 |
6 | 110552504504144141 |
7 | 4154130102210016 |
oct | 446070402342075 |
9 | 78504360325037 |
10 | 20211110102077 |
11 | 6492535828384 |
12 | 232506ba68051 |
13 | b37b9029a1bb |
14 | 4dc319ab000d |
15 | 250b0d897437 |
hex | 1261c409c43d |
20211110102077 has 2 divisors, whose sum is σ = 20211110102078. Its totient is φ = 20211110102076.
The previous prime is 20211110102059. The next prime is 20211110102143. The reversal of 20211110102077 is 77020101111202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15602334100441 + 4608776001636 = 3949979^2 + 2146806^2 .
It is a cyclic number.
It is not a de Polignac number, because 20211110102077 - 211 = 20211110100029 is a prime.
It is a super-2 number, since 2×202111101020772 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20211110102047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10105555051038 + 10105555051039.
It is an arithmetic number, because the mean of its divisors is an integer number (10105555051039).
Almost surely, 220211110102077 is an apocalyptic number.
It is an amenable number.
20211110102077 is a deficient number, since it is larger than the sum of its proper divisors (1).
20211110102077 is an equidigital number, since it uses as much as digits as its factorization.
20211110102077 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 392, while the sum is 25.
Adding to 20211110102077 its reverse (77020101111202), we get a palindrome (97231211213279).
The spelling of 20211110102077 in words is "twenty trillion, two hundred eleven billion, one hundred ten million, one hundred two thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •