Base | Representation |
---|---|
bin | 110011110010101011… |
… | …0010011010101001101 |
3 | 101122002020211120121122 |
4 | 1213211112103111031 |
5 | 3310240313324323 |
6 | 123032241410325 |
7 | 11015120332235 |
oct | 1474526232515 |
9 | 348066746548 |
10 | 111222011213 |
11 | 43194a20235 |
12 | 196800399a5 |
13 | a64672a071 |
14 | 5551602cc5 |
15 | 2d5e52eec8 |
hex | 19e559354d |
111222011213 has 2 divisors, whose sum is σ = 111222011214. Its totient is φ = 111222011212.
The previous prime is 111222011167. The next prime is 111222011231. The reversal of 111222011213 is 312110222111.
It is a happy number.
Together with next prime (111222011231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108370664809 + 2851346404 = 329197^2 + 53398^2 .
It is a cyclic number.
It is not a de Polignac number, because 111222011213 - 26 = 111222011149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111222011191 and 111222011200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111222011293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55611005606 + 55611005607.
It is an arithmetic number, because the mean of its divisors is an integer number (55611005607).
Almost surely, 2111222011213 is an apocalyptic number.
It is an amenable number.
111222011213 is a deficient number, since it is larger than the sum of its proper divisors (1).
111222011213 is an equidigital number, since it uses as much as digits as its factorization.
111222011213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 111222011213 its reverse (312110222111), we get a palindrome (423332233324).
The spelling of 111222011213 in words is "one hundred eleven billion, two hundred twenty-two million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •