Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …1000001111111100101101 |
3 | 1022210121021001101101100002 |
4 | 2103020212220033330231 |
5 | 2311124312240200302 |
6 | 33300532455514045 |
7 | 2062332014210003 |
oct | 223104650177455 |
9 | 38717231341302 |
10 | 10111001100077 |
11 | 3249062589469 |
12 | 11736b5988925 |
13 | 584603b89227 |
14 | 26d537268a73 |
15 | 128024d87c02 |
hex | 93226a0ff2d |
10111001100077 has 2 divisors, whose sum is σ = 10111001100078. Its totient is φ = 10111001100076.
The previous prime is 10111001100029. The next prime is 10111001100091. The reversal of 10111001100077 is 77000110011101.
10111001100077 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9565251015076 + 545750085001 = 3092774^2 + 738749^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111001100077 - 210 = 10111001099053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111001100677) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055500550038 + 5055500550039.
It is an arithmetic number, because the mean of its divisors is an integer number (5055500550039).
Almost surely, 210111001100077 is an apocalyptic number.
It is an amenable number.
10111001100077 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111001100077 is an equidigital number, since it uses as much as digits as its factorization.
10111001100077 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 49, while the sum is 20.
Adding to 10111001100077 its reverse (77000110011101), we get a palindrome (87111111111178).
The spelling of 10111001100077 in words is "ten trillion, one hundred eleven billion, one million, one hundred thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •