Base | Representation |
---|---|
bin | 110010100001101111100001… |
… | …110010101110111111001001 |
3 | 1002010211010111121200002112221 |
4 | 302201233201302232333021 |
5 | 213111332303340213001 |
6 | 2104342544200334041 |
7 | 64543642021235422 |
oct | 6241574162567711 |
9 | 1063733447602487 |
10 | 222221101101001 |
11 | 64896492308912 |
12 | 20b0bb31174321 |
13 | 96cc48a978912 |
14 | 3cc37b7042649 |
15 | 1aa5732ae51a1 |
hex | ca1be1caefc9 |
222221101101001 has 4 divisors (see below), whose sum is σ = 222221156403472. Its totient is φ = 222221045798532.
The previous prime is 222221101100969. The next prime is 222221101101017. The reversal of 222221101101001 is 100101101122222.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 222221101101001 - 25 = 222221101100969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222221101101031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21107631 + ... + 29832436.
It is an arithmetic number, because the mean of its divisors is an integer number (55555289100868).
Almost surely, 2222221101101001 is an apocalyptic number.
It is an amenable number.
222221101101001 is a deficient number, since it is larger than the sum of its proper divisors (55302471).
222221101101001 is an equidigital number, since it uses as much as digits as its factorization.
222221101101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55302470.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 222221101101001 its reverse (100101101122222), we get a palindrome (322322202223223).
The spelling of 222221101101001 in words is "two hundred twenty-two trillion, two hundred twenty-one billion, one hundred one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •