Base | Representation |
---|---|
bin | 110011101111011001… |
… | …0101100000111100101 |
3 | 101121210120212001102101 |
4 | 1213132302230013211 |
5 | 3310024133343021 |
6 | 123013312012101 |
7 | 11012313343465 |
oct | 1473662540745 |
9 | 347716761371 |
10 | 111112012261 |
11 | 4313891a408 |
12 | 1964b231031 |
13 | a6299c5323 |
14 | 5540b6bba5 |
15 | 2d54a52a91 |
hex | 19decac1e5 |
111112012261 has 2 divisors, whose sum is σ = 111112012262. Its totient is φ = 111112012260.
The previous prime is 111112012199. The next prime is 111112012267. The reversal of 111112012261 is 162210211111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97100792100 + 14011220161 = 311610^2 + 118369^2 .
It is a cyclic number.
It is not a de Polignac number, because 111112012261 - 219 = 111111487973 is a prime.
It is a super-2 number, since 2×1111120122612 (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 (111112012267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55556006130 + 55556006131.
It is an arithmetic number, because the mean of its divisors is an integer number (55556006131).
Almost surely, 2111112012261 is an apocalyptic number.
It is an amenable number.
111112012261 is a deficient number, since it is larger than the sum of its proper divisors (1).
111112012261 is an equidigital number, since it uses as much as digits as its factorization.
111112012261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 111112012261 its reverse (162210211111), we get a palindrome (273322223372).
The spelling of 111112012261 in words is "one hundred eleven billion, one hundred twelve million, twelve thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •