Base | Representation |
---|---|
bin | 110010011110100001101110… |
… | …010111011001001111101111 |
3 | 1002010001000010011001010200122 |
4 | 302132201232113121033233 |
5 | 213044222222013102002 |
6 | 2104053240414515155 |
7 | 64521656646245663 |
oct | 6236415627311757 |
9 | 1063030104033618 |
10 | 222000121222127 |
11 | 648107a4998146 |
12 | 20a9513b505abb |
13 | 96b46a1c6b241 |
14 | 3cb6c128888a3 |
15 | 1a9eaec89a6a2 |
hex | c9e86e5d93ef |
222000121222127 has 2 divisors, whose sum is σ = 222000121222128. Its totient is φ = 222000121222126.
The previous prime is 222000121222031. The next prime is 222000121222141. The reversal of 222000121222127 is 721222121000222.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 222000121222127 - 28 = 222000121221871 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 222000121222096 and 222000121222105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222009121222127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111000060611063 + 111000060611064.
It is an arithmetic number, because the mean of its divisors is an integer number (111000060611064).
Almost surely, 2222000121222127 is an apocalyptic number.
222000121222127 is a deficient number, since it is larger than the sum of its proper divisors (1).
222000121222127 is an equidigital number, since it uses as much as digits as its factorization.
222000121222127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 26.
Adding to 222000121222127 its reverse (721222121000222), we get a palindrome (943222242222349).
The spelling of 222000121222127 in words is "two hundred twenty-two trillion, one hundred twenty-one million, two hundred twenty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •