Base | Representation |
---|---|
bin | 110011101111111100… |
… | …0100010000101000001 |
3 | 101121211212022020120212 |
4 | 1213133320202011001 |
5 | 3310043330234332 |
6 | 123015204243505 |
7 | 11012625100406 |
oct | 1473770420501 |
9 | 347755266525 |
10 | 111130321217 |
11 | 43148195183 |
12 | 196553a0595 |
13 | a630735b26 |
14 | 55433762ad |
15 | 2d5646c8b2 |
hex | 19dfe22141 |
111130321217 has 2 divisors, whose sum is σ = 111130321218. Its totient is φ = 111130321216.
The previous prime is 111130321163. The next prime is 111130321249. The reversal of 111130321217 is 712123031111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110731879696 + 398441521 = 332764^2 + 19961^2 .
It is a cyclic number.
It is not a de Polignac number, because 111130321217 - 26 = 111130321153 is a prime.
It is a super-2 number, since 2×1111303212172 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111130321192 and 111130321201.
It is not a weakly prime, because it can be changed into another prime (111130321297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55565160608 + 55565160609.
It is an arithmetic number, because the mean of its divisors is an integer number (55565160609).
Almost surely, 2111130321217 is an apocalyptic number.
It is an amenable number.
111130321217 is a deficient number, since it is larger than the sum of its proper divisors (1).
111130321217 is an equidigital number, since it uses as much as digits as its factorization.
111130321217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 23.
Adding to 111130321217 its reverse (712123031111), we get a palindrome (823253352328).
The spelling of 111130321217 in words is "one hundred eleven billion, one hundred thirty million, three hundred twenty-one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •