Base | Representation |
---|---|
bin | 111100010001000… |
… | …0111101010101101 |
3 | 12012221010220220212 |
4 | 1320202013222231 |
5 | 13120141211341 |
6 | 532354552205 |
7 | 101053334423 |
oct | 17042075255 |
9 | 5187126825 |
10 | 2022210221 |
11 | 948537519 |
12 | 485298665 |
13 | 262c527c5 |
14 | 1527db113 |
15 | bc7ed5eb |
hex | 78887aad |
2022210221 has 4 divisors (see below), whose sum is σ = 2022357792. Its totient is φ = 2022062652.
The previous prime is 2022210217. The next prime is 2022210361. The reversal of 2022210221 is 1220122202.
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 2022210221 - 22 = 2022210217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2022210196 and 2022210205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022210121) 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, 50855 + ... + 81428.
It is an arithmetic number, because the mean of its divisors is an integer number (505589448).
Almost surely, 22022210221 is an apocalyptic number.
It is an amenable number.
2022210221 is a deficient number, since it is larger than the sum of its proper divisors (147571).
2022210221 is a wasteful number, since it uses less digits than its factorization.
2022210221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147570.
The product of its (nonzero) digits is 64, while the sum is 14.
The square root of 2022210221 is about 44968.9917721089. The cubic root of 2022210221 is about 1264.5677455792.
Adding to 2022210221 its reverse (1220122202), we get a palindrome (3242332423).
The spelling of 2022210221 in words is "two billion, twenty-two million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •