Base | Representation |
---|---|
bin | 100001000101011… |
… | …0001111011110111 |
3 | 2212100220001102012 |
4 | 1002022301323313 |
5 | 4233142402411 |
6 | 302053434435 |
7 | 36336611651 |
oct | 10212617367 |
9 | 2770801365 |
10 | 1110122231 |
11 | 51a6a9299 |
12 | 26b93ba1b |
13 | 148cb607a |
14 | a76156d1 |
15 | 676d518b |
hex | 422b1ef7 |
1110122231 has 2 divisors, whose sum is σ = 1110122232. Its totient is φ = 1110122230.
The previous prime is 1110122213. The next prime is 1110122239. The reversal of 1110122231 is 1322210111.
Together with previous prime (1110122213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110122231 is a prime.
It is a super-2 number, since 2×11101222312 = 2464742735520834722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110122239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555061115 + 555061116.
It is an arithmetic number, because the mean of its divisors is an integer number (555061116).
Almost surely, 21110122231 is an apocalyptic number.
1110122231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110122231 is an equidigital number, since it uses as much as digits as its factorization.
1110122231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 1110122231 is about 33318.4968298391. The cubic root of 1110122231 is about 1035.4368094082.
Adding to 1110122231 its reverse (1322210111), we get a palindrome (2432332342).
The spelling of 1110122231 in words is "one billion, one hundred ten million, one hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •