Base | Representation |
---|---|
bin | 101010000000… |
… | …0011111100001 |
3 | 1112102211122211 |
4 | 1110000133201 |
5 | 21114201423 |
6 | 2104002121 |
7 | 355120261 |
oct | 124003741 |
9 | 45384584 |
10 | 22022113 |
11 | 114815a3 |
12 | 7460341 |
13 | 4740949 |
14 | 2cd37a1 |
15 | 1e0010d |
hex | 15007e1 |
22022113 has 2 divisors, whose sum is σ = 22022114. Its totient is φ = 22022112.
The previous prime is 22022111. The next prime is 22022131. The reversal of 22022113 is 31122022.
Together with next prime (22022131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21418384 + 603729 = 4628^2 + 777^2 .
It is a cyclic number.
It is not a de Polignac number, because 22022113 - 21 = 22022111 is a prime.
Together with 22022111, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 22022093 and 22022102.
It is not a weakly prime, because it can be changed into another prime (22022111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11011056 + 11011057.
It is an arithmetic number, because the mean of its divisors is an integer number (11011057).
Almost surely, 222022113 is an apocalyptic number.
It is an amenable number.
22022113 is a deficient number, since it is larger than the sum of its proper divisors (1).
22022113 is an equidigital number, since it uses as much as digits as its factorization.
22022113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 22022113 is about 4692.7724215010. The cubic root of 22022113 is about 280.2977826828.
Adding to 22022113 its reverse (31122022), we get a palindrome (53144135).
Subtracting 22022113 from its reverse (31122022), we obtain a palindrome (9099909).
The spelling of 22022113 in words is "twenty-two million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •