Base | Representation |
---|---|
bin | 1100111011011011011… |
… | …1110000100000010001 |
3 | 210020022022210021210021 |
4 | 3032312313300200101 |
5 | 12114341004331001 |
6 | 250011522103441 |
7 | 22022061523606 |
oct | 3166667604021 |
9 | 706268707707 |
10 | 222111402001 |
11 | 86219106855 |
12 | 370687aab81 |
13 | 17c392776b8 |
14 | aa709806ad |
15 | 5b9e75aba1 |
hex | 33b6df0811 |
222111402001 has 2 divisors, whose sum is σ = 222111402002. Its totient is φ = 222111402000.
The previous prime is 222111401983. The next prime is 222111402011. The reversal of 222111402001 is 100204111222.
222111402001 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., 186105960000 + 36005442001 = 431400^2 + 189751^2 .
It is a cyclic number.
It is not a de Polignac number, because 222111402001 - 27 = 222111401873 is a prime.
It is not a weakly prime, because it can be changed into another prime (222111402011) 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, 111055701000 + 111055701001.
It is an arithmetic number, because the mean of its divisors is an integer number (111055701001).
Almost surely, 2222111402001 is an apocalyptic number.
It is an amenable number.
222111402001 is a deficient number, since it is larger than the sum of its proper divisors (1).
222111402001 is an equidigital number, since it uses as much as digits as its factorization.
222111402001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 222111402001 its reverse (100204111222), we get a palindrome (322315513223).
The spelling of 222111402001 in words is "two hundred twenty-two billion, one hundred eleven million, four hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •