Base | Representation |
---|---|
bin | 10100101100000000… |
… | …110010100101111101 |
3 | 2010100002010120102112 |
4 | 110230000302211331 |
5 | 330443042204323 |
6 | 14112110503405 |
7 | 1414315302122 |
oct | 245400624575 |
9 | 63302116375 |
10 | 22213241213 |
11 | 9469882999 |
12 | 437b204b65 |
13 | 2130094217 |
14 | 110a20c749 |
15 | 8a0201178 |
hex | 52c03297d |
22213241213 has 2 divisors, whose sum is σ = 22213241214. Its totient is φ = 22213241212.
The previous prime is 22213241203. The next prime is 22213241261. The reversal of 22213241213 is 31214231222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21662541124 + 550700089 = 147182^2 + 23467^2 .
It is a cyclic number.
It is not a de Polignac number, because 22213241213 - 214 = 22213224829 is a prime.
It is a super-2 number, since 2×222132412132 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22213241203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11106620606 + 11106620607.
It is an arithmetic number, because the mean of its divisors is an integer number (11106620607).
Almost surely, 222213241213 is an apocalyptic number.
It is an amenable number.
22213241213 is a deficient number, since it is larger than the sum of its proper divisors (1).
22213241213 is an equidigital number, since it uses as much as digits as its factorization.
22213241213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1152, while the sum is 23.
Adding to 22213241213 its reverse (31214231222), we get a palindrome (53427472435).
Subtracting 22213241213 from its reverse (31214231222), we obtain a palindrome (9000990009).
The spelling of 22213241213 in words is "twenty-two billion, two hundred thirteen million, two hundred forty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •