Base | Representation |
---|---|
bin | 1001001001010010000000… |
… | …00001110100110010101101 |
3 | 2122012111201012220221200111 |
4 | 10210221000001310302231 |
5 | 10113441001420200302 |
6 | 110434242453100021 |
7 | 4143623204645155 |
oct | 444510001646255 |
9 | 78174635827614 |
10 | 20110111100077 |
11 | 64537174a0299 |
12 | 2309583627611 |
13 | b2b4b580c91b |
14 | 4d74980c1765 |
15 | 24d19bac70d7 |
hex | 124a40074cad |
20110111100077 has 2 divisors, whose sum is σ = 20110111100078. Its totient is φ = 20110111100076.
The previous prime is 20110111099951. The next prime is 20110111100087. The reversal of 20110111100077 is 77000111101102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13760991195561 + 6349119904516 = 3709581^2 + 2519746^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110111100077 - 211 = 20110111098029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110111100087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055055550038 + 10055055550039.
It is an arithmetic number, because the mean of its divisors is an integer number (10055055550039).
Almost surely, 220110111100077 is an apocalyptic number.
It is an amenable number.
20110111100077 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110111100077 is an equidigital number, since it uses as much as digits as its factorization.
20110111100077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 98, while the sum is 22.
Adding to 20110111100077 its reverse (77000111101102), we get a palindrome (97110222201179).
The spelling of 20110111100077 in words is "twenty trillion, one hundred ten billion, one hundred eleven million, one hundred thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •