Base | Representation |
---|---|
bin | 110011101100011100… |
… | …1011100110001011101 |
3 | 101121112200202212021102 |
4 | 1213120321130301131 |
5 | 3304323324333432 |
6 | 122555420242445 |
7 | 11010002650223 |
oct | 1473071346135 |
9 | 347480685242 |
10 | 111013121117 |
11 | 43098015a98 |
12 | 196220a0425 |
13 | a61237c462 |
14 | 5531988b13 |
15 | 2d4b01b962 |
hex | 19d8e5cc5d |
111013121117 has 2 divisors, whose sum is σ = 111013121118. Its totient is φ = 111013121116.
The previous prime is 111013121083. The next prime is 111013121129. The reversal of 111013121117 is 711121310111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109209759961 + 1803361156 = 330469^2 + 42466^2 .
It is an emirp because it is prime and its reverse (711121310111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111013121117 - 28 = 111013120861 is a prime.
It is a super-2 number, since 2×1110131211172 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111013121917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55506560558 + 55506560559.
It is an arithmetic number, because the mean of its divisors is an integer number (55506560559).
Almost surely, 2111013121117 is an apocalyptic number.
It is an amenable number.
111013121117 is a deficient number, since it is larger than the sum of its proper divisors (1).
111013121117 is an equidigital number, since it uses as much as digits as its factorization.
111013121117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 20.
Adding to 111013121117 its reverse (711121310111), we get a palindrome (822134431228).
The spelling of 111013121117 in words is "one hundred eleven billion, thirteen million, one hundred twenty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •