Base | Representation |
---|---|
bin | 101010011111… |
… | …1101110101011 |
3 | 1112220222222002 |
4 | 1110333232223 |
5 | 21200444011 |
6 | 2113321215 |
7 | 360246365 |
oct | 124775653 |
9 | 45828862 |
10 | 22281131 |
11 | 11639164 |
12 | 756620b |
13 | 4801802 |
14 | 2d5dd35 |
15 | 1e51c3b |
hex | 153fbab |
22281131 has 2 divisors, whose sum is σ = 22281132. Its totient is φ = 22281130.
The previous prime is 22281113. The next prime is 22281151. The reversal of 22281131 is 13118222.
Together with previous prime (22281113) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (22281151) can be obtained adding 22281131 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22281131 is a prime.
It is a super-2 number, since 2×222811312 = 992897597278322, which contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (22281151) 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, 11140565 + 11140566.
It is an arithmetic number, because the mean of its divisors is an integer number (11140566).
Almost surely, 222281131 is an apocalyptic number.
22281131 is a deficient number, since it is larger than the sum of its proper divisors (1).
22281131 is an equidigital number, since it uses as much as digits as its factorization.
22281131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 192, while the sum is 20.
The square root of 22281131 is about 4720.2892919820. The cubic root of 22281131 is about 281.3924305084.
Adding to 22281131 its reverse (13118222), we get a palindrome (35399353).
The spelling of 22281131 in words is "twenty-two million, two hundred eighty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •