Base | Representation |
---|---|
bin | 110010011111111111101100… |
… | …011001101100011110011001 |
3 | 1002010101122112221220020102020 |
4 | 302133333230121230132121 |
5 | 213102400342110032301 |
6 | 2104211444445525053 |
7 | 64532161215602364 |
oct | 6237775431543631 |
9 | 1063348487806366 |
10 | 222101020002201 |
11 | 6484a5716a1a9a |
12 | 20ab07ba273789 |
13 | 96c1061a37cc2 |
14 | 3cbba650290db |
15 | 1aa2555970436 |
hex | c9ffec66c799 |
222101020002201 has 4 divisors (see below), whose sum is σ = 296134693336272. Its totient is φ = 148067346668132.
The previous prime is 222101020002131. The next prime is 222101020002221. The reversal of 222101020002201 is 102200020101222.
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 222101020002201 - 27 = 222101020002073 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (222101020002221) 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, 37016836667031 + ... + 37016836667036.
It is an arithmetic number, because the mean of its divisors is an integer number (74033673334068).
Almost surely, 2222101020002201 is an apocalyptic number.
It is an amenable number.
222101020002201 is a deficient number, since it is larger than the sum of its proper divisors (74033673334071).
222101020002201 is an equidigital number, since it uses as much as digits as its factorization.
222101020002201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74033673334070.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 222101020002201 its reverse (102200020101222), we get a palindrome (324301040103423).
The spelling of 222101020002201 in words is "two hundred twenty-two trillion, one hundred one billion, twenty million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •