Base | Representation |
---|---|
bin | 11001001010101… |
… | …101111101101111 |
3 | 1002102112000112122 |
4 | 121022231331233 |
5 | 1331043140421 |
6 | 105522023155 |
7 | 13314660506 |
oct | 3112557557 |
9 | 1072460478 |
10 | 422240111 |
11 | 1a7386277 |
12 | b94a7abb |
13 | 6962a527 |
14 | 4011383d |
15 | 271082ab |
hex | 192adf6f |
422240111 has 2 divisors, whose sum is σ = 422240112. Its totient is φ = 422240110.
The previous prime is 422240023. The next prime is 422240113. The reversal of 422240111 is 111042224.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 422240111 - 210 = 422239087 is a prime.
It is a super-2 number, since 2×4222401112 = 356573422674584642, which contains 22 as substring.
Together with 422240113, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 422240111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (422240113) 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, 211120055 + 211120056.
It is an arithmetic number, because the mean of its divisors is an integer number (211120056).
Almost surely, 2422240111 is an apocalyptic number.
422240111 is a deficient number, since it is larger than the sum of its proper divisors (1).
422240111 is an equidigital number, since it uses as much as digits as its factorization.
422240111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 422240111 is about 20548.4819633957. The cubic root of 422240111 is about 750.2162996873.
Adding to 422240111 its reverse (111042224), we get a palindrome (533282335).
The spelling of 422240111 in words is "four hundred twenty-two million, two hundred forty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •