Base | Representation |
---|---|
bin | 1100111011100101100… |
… | …1111010111101001001 |
3 | 210020102021210000201202 |
4 | 3032321121322331021 |
5 | 12114432400142022 |
6 | 250020041153545 |
7 | 22023116045063 |
oct | 3167131727511 |
9 | 706367700652 |
10 | 222153912137 |
11 | 862401012a3 |
12 | 3707aa8b8b5 |
13 | 17c4500c921 |
14 | aa76488733 |
15 | 5ba3356592 |
hex | 33b967af49 |
222153912137 has 2 divisors, whose sum is σ = 222153912138. Its totient is φ = 222153912136.
The previous prime is 222153912133. The next prime is 222153912139. The reversal of 222153912137 is 731219351222.
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., 202915112521 + 19238799616 = 450461^2 + 138704^2 .
It is a cyclic number.
It is not a de Polignac number, because 222153912137 - 22 = 222153912133 is a prime.
Together with 222153912139, 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 222153912137.
It is not a weakly prime, because it can be changed into another prime (222153912133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111076956068 + 111076956069.
It is an arithmetic number, because the mean of its divisors is an integer number (111076956069).
Almost surely, 2222153912137 is an apocalyptic number.
It is an amenable number.
222153912137 is a deficient number, since it is larger than the sum of its proper divisors (1).
222153912137 is an equidigital number, since it uses as much as digits as its factorization.
222153912137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 45360, while the sum is 38.
The spelling of 222153912137 in words is "two hundred twenty-two billion, one hundred fifty-three million, nine hundred twelve thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •