Base | Representation |
---|---|
bin | 1010000001011101000101… |
… | …0101001111110011000101 |
3 | 1110000111210221020002111211 |
4 | 2200113101111033303011 |
5 | 2421023132344401432 |
6 | 35234322051131421 |
7 | 2215114266664645 |
oct | 240272125176305 |
9 | 43014727202454 |
10 | 11020103122117 |
11 | 3569665a12121 |
12 | 129b92a2a3b71 |
13 | 61c26429659b |
14 | 2a1539422525 |
15 | 1419d14e4d47 |
hex | a05d154fcc5 |
11020103122117 has 2 divisors, whose sum is σ = 11020103122118. Its totient is φ = 11020103122116.
The previous prime is 11020103122109. The next prime is 11020103122157. The reversal of 11020103122117 is 71122130102011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10671453024961 + 348650097156 = 3266719^2 + 590466^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020103122117 - 23 = 11020103122109 is a prime.
It is a super-3 number, since 3×110201031221173 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020103122157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510051561058 + 5510051561059.
It is an arithmetic number, because the mean of its divisors is an integer number (5510051561059).
Almost surely, 211020103122117 is an apocalyptic number.
It is an amenable number.
11020103122117 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020103122117 is an equidigital number, since it uses as much as digits as its factorization.
11020103122117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 11020103122117 its reverse (71122130102011), we get a palindrome (82142233224128).
The spelling of 11020103122117 in words is "eleven trillion, twenty billion, one hundred three million, one hundred twenty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •