Base | Representation |
---|---|
bin | 110010011110110101010010… |
… | …000011111111101010010011 |
3 | 1002010010000022200020002211022 |
4 | 302132311102003333222103 |
5 | 213100043224012223102 |
6 | 2104111032305310055 |
7 | 64523332233226265 |
oct | 6236652203775223 |
9 | 1063100280202738 |
10 | 222021121211027 |
11 | 648196a0932676 |
12 | 20a9922033532b |
13 | 96b666a87ac88 |
14 | 3cb7c458b7b35 |
15 | 1aa042b2e45a2 |
hex | c9ed520ffa93 |
222021121211027 has 2 divisors, whose sum is σ = 222021121211028. Its totient is φ = 222021121211026.
The previous prime is 222021121211009. The next prime is 222021121211069. The reversal of 222021121211027 is 720112121120222.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 222021121211027 - 28 = 222021121210771 is a prime.
It is a super-3 number, since 3×2220211212110273 (a number of 44 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 222021121210987 and 222021121211005.
It is not a weakly prime, because it can be changed into another prime (222021120211027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111010560605513 + 111010560605514.
It is an arithmetic number, because the mean of its divisors is an integer number (111010560605514).
Almost surely, 2222021121211027 is an apocalyptic number.
222021121211027 is a deficient number, since it is larger than the sum of its proper divisors (1).
222021121211027 is an equidigital number, since it uses as much as digits as its factorization.
222021121211027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 896, while the sum is 26.
Adding to 222021121211027 its reverse (720112121120222), we get a palindrome (942133242331249).
The spelling of 222021121211027 in words is "two hundred twenty-two trillion, twenty-one billion, one hundred twenty-one million, two hundred eleven thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •