Base | Representation |
---|---|
bin | 1001001001010101111010… |
… | …01000100111100110110101 |
3 | 2122012201010111102210110202 |
4 | 10210222331020213212311 |
5 | 10114004301232024302 |
6 | 110435231032330245 |
7 | 4144026212406311 |
oct | 444527510474665 |
9 | 78181114383422 |
10 | 20112210033077 |
11 | 64545a426a768 |
12 | 2309a6a543985 |
13 | b2b75b615c06 |
14 | 4d7616b70b41 |
15 | 24d270ecd202 |
hex | 124abd2279b5 |
20112210033077 has 2 divisors, whose sum is σ = 20112210033078. Its totient is φ = 20112210033076.
The previous prime is 20112210033011. The next prime is 20112210033121. The reversal of 20112210033077 is 77033001221102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19195842265636 + 916367767441 = 4381306^2 + 957271^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112210033077 - 216 = 20112209967541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20112212033077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10056105016538 + 10056105016539.
It is an arithmetic number, because the mean of its divisors is an integer number (10056105016539).
Almost surely, 220112210033077 is an apocalyptic number.
It is an amenable number.
20112210033077 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112210033077 is an equidigital number, since it uses as much as digits as its factorization.
20112210033077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3528, while the sum is 29.
Adding to 20112210033077 its reverse (77033001221102), we get a palindrome (97145211254179).
The spelling of 20112210033077 in words is "twenty trillion, one hundred twelve billion, two hundred ten million, thirty-three thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •