Base | Representation |
---|---|
bin | 1100111011000101101… |
… | …1100010101000101001 |
3 | 210020001222000122011101 |
4 | 3032301123202220221 |
5 | 12114144122302311 |
6 | 245554501401401 |
7 | 22016602605625 |
oct | 3166133425051 |
9 | 706058018141 |
10 | 222020119081 |
11 | 86181629622 |
12 | 37042109261 |
13 | 17c23396837 |
14 | aa627bc185 |
15 | 5b96728ec1 |
hex | 33b16e2a29 |
222020119081 has 2 divisors, whose sum is σ = 222020119082. Its totient is φ = 222020119080.
The previous prime is 222020119043. The next prime is 222020119091. The reversal of 222020119081 is 180911020222.
222020119081 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123225571225 + 98794547856 = 351035^2 + 314316^2 .
It is a cyclic number.
It is not a de Polignac number, because 222020119081 - 27 = 222020118953 is a prime.
It is a super-2 number, since 2×2220201190812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (222020119001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111010059540 + 111010059541.
It is an arithmetic number, because the mean of its divisors is an integer number (111010059541).
Almost surely, 2222020119081 is an apocalyptic number.
It is an amenable number.
222020119081 is a deficient number, since it is larger than the sum of its proper divisors (1).
222020119081 is an equidigital number, since it uses as much as digits as its factorization.
222020119081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 28.
The spelling of 222020119081 in words is "two hundred twenty-two billion, twenty million, one hundred nineteen thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •