Base | Representation |
---|---|
bin | 101011100110… |
… | …1100100111101 |
3 | 1121000111221222 |
4 | 1113031210331 |
5 | 21323042031 |
6 | 2134003125 |
7 | 365216321 |
oct | 127154475 |
9 | 47014858 |
10 | 22862141 |
11 | 119a5735 |
12 | 77a64a5 |
13 | 49760c3 |
14 | 3071981 |
15 | 2018e7b |
hex | 15cd93d |
22862141 has 2 divisors, whose sum is σ = 22862142. Its totient is φ = 22862140.
The previous prime is 22862107. The next prime is 22862143. The reversal of 22862141 is 14126822.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20748025 + 2114116 = 4555^2 + 1454^2 .
It is a cyclic number.
It is not a de Polignac number, because 22862141 - 222 = 18667837 is a prime.
It is a super-2 number, since 2×228621412 = 1045354982207762, which contains 22 as substring.
Together with 22862143, 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 22862141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22862143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11431070 + 11431071.
It is an arithmetic number, because the mean of its divisors is an integer number (11431071).
Almost surely, 222862141 is an apocalyptic number.
It is an amenable number.
22862141 is a deficient number, since it is larger than the sum of its proper divisors (1).
22862141 is an equidigital number, since it uses as much as digits as its factorization.
22862141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1536, while the sum is 26.
The square root of 22862141 is about 4781.4371270571. The cubic root of 22862141 is about 283.8173667084.
Adding to 22862141 its reverse (14126822), we get a palindrome (36988963).
The spelling of 22862141 in words is "twenty-two million, eight hundred sixty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •