Base | Representation |
---|---|
bin | 1000001101000011… |
… | …0011111000101001 |
3 | 12200110212110211021 |
4 | 2003100303320221 |
5 | 14002232101441 |
6 | 1002305132441 |
7 | 105400402441 |
oct | 20320637051 |
9 | 5613773737 |
10 | 2202222121 |
11 | a30108090 |
12 | 51562a121 |
13 | 29132bc18 |
14 | 16c699121 |
15 | cd50a3d1 |
hex | 83433e29 |
2202222121 has 8 divisors (see below), whose sum is σ = 2404419264. Its totient is φ = 2000357520.
The previous prime is 2202222089. The next prime is 2202222131. The reversal of 2202222121 is 1212222022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2202222121 - 25 = 2202222089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2202222095 and 2202222104.
It is not an unprimeable number, because it can be changed into a prime (2202222131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69181 + ... + 95866.
It is an arithmetic number, because the mean of its divisors is an integer number (300552408).
Almost surely, 22202222121 is an apocalyptic number.
It is an amenable number.
2202222121 is a deficient number, since it is larger than the sum of its proper divisors (202197143).
2202222121 is a wasteful number, since it uses less digits than its factorization.
2202222121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166271.
The product of its (nonzero) digits is 128, while the sum is 16.
The square root of 2202222121 is about 46927.8395091869. The cubic root of 2202222121 is about 1301.0291891345.
Adding to 2202222121 its reverse (1212222022), we get a palindrome (3414444143).
Subtracting from 2202222121 its reverse (1212222022), we obtain a palindrome (990000099).
The spelling of 2202222121 in words is "two billion, two hundred two million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •