Base | Representation |
---|---|
bin | 110010100001101111100001… |
… | …110010110100001001100101 |
3 | 1002010211010111121201011120012 |
4 | 302201233201302310021211 |
5 | 213111332303341402044 |
6 | 2104342544201020005 |
7 | 64543642021354163 |
oct | 6241574162641145 |
9 | 1063733447634505 |
10 | 222221101122149 |
11 | 64896492322798 |
12 | 20b0bb31184605 |
13 | 96cc48a98542c |
14 | 3cc37b704a233 |
15 | 1aa5732aeb59e |
hex | ca1be1cb4265 |
222221101122149 has 2 divisors, whose sum is σ = 222221101122150. Its totient is φ = 222221101122148.
The previous prime is 222221101122131. The next prime is 222221101122301. The reversal of 222221101122149 is 941221101122222.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 134574337981924 + 87646763140225 = 11600618^2 + 9361985^2 .
It is a cyclic number.
It is not a de Polignac number, because 222221101122149 - 216 = 222221101056613 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222221101124149) 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, 111110550561074 + 111110550561075.
It is an arithmetic number, because the mean of its divisors is an integer number (111110550561075).
Almost surely, 2222221101122149 is an apocalyptic number.
It is an amenable number.
222221101122149 is a deficient number, since it is larger than the sum of its proper divisors (1).
222221101122149 is an equidigital number, since it uses as much as digits as its factorization.
222221101122149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 32.
The spelling of 222221101122149 in words is "two hundred twenty-two trillion, two hundred twenty-one billion, one hundred one million, one hundred twenty-two thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •