Base | Representation |
---|---|
bin | 10100101100011110… |
… | …110100001110100111 |
3 | 2010100121221110102201 |
4 | 110230132310032213 |
5 | 331002101042411 |
6 | 14112551315331 |
7 | 1414442223523 |
oct | 245436641647 |
9 | 63317843381 |
10 | 22221112231 |
11 | 947326956a |
12 | 438197bb47 |
13 | 21318bba26 |
14 | 110b29ad83 |
15 | 8a0c583c1 |
hex | 52c7b43a7 |
22221112231 has 2 divisors, whose sum is σ = 22221112232. Its totient is φ = 22221112230.
The previous prime is 22221112157. The next prime is 22221112247. The reversal of 22221112231 is 13221112222.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22221112231 - 27 = 22221112103 is a prime.
It is a super-2 number, since 2×222211122312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22221112199 and 22221112208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22221112271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11110556115 + 11110556116.
It is an arithmetic number, because the mean of its divisors is an integer number (11110556116).
Almost surely, 222221112231 is an apocalyptic number.
22221112231 is a deficient number, since it is larger than the sum of its proper divisors (1).
22221112231 is an equidigital number, since it uses as much as digits as its factorization.
22221112231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 192, while the sum is 19.
Adding to 22221112231 its reverse (13221112222), we get a palindrome (35442224453).
Subtracting from 22221112231 its reverse (13221112222), we obtain a palindrome (9000000009).
The spelling of 22221112231 in words is "twenty-two billion, two hundred twenty-one million, one hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •