Base | Representation |
---|---|
bin | 111100010000101… |
… | …0110110101101101 |
3 | 12012220202202120110 |
4 | 1320201112311231 |
5 | 13120113311341 |
6 | 532350410233 |
7 | 101051542350 |
oct | 17041266555 |
9 | 5186682513 |
10 | 2022010221 |
11 | 948410230 |
12 | 485200979 |
13 | 262bb276a |
14 | 152788297 |
15 | bc7ae216 |
hex | 78856d6d |
2022010221 has 16 divisors (see below), whose sum is σ = 3361264128. Its totient is φ = 1050394800.
The previous prime is 2022010213. The next prime is 2022010259. The reversal of 2022010221 is 1220102202.
It is not a de Polignac number, because 2022010221 - 23 = 2022010213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2022010197 and 2022010206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022010271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4376415 + ... + 4376876.
It is an arithmetic number, because the mean of its divisors is an integer number (210079008).
Almost surely, 22022010221 is an apocalyptic number.
2022010221 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2022010221 is a deficient number, since it is larger than the sum of its proper divisors (1339253907).
2022010221 is a wasteful number, since it uses less digits than its factorization.
2022010221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8753312.
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 2022010221 is about 44966.7679625743. The cubic root of 2022010221 is about 1264.5260549107.
Adding to 2022010221 its reverse (1220102202), we get a palindrome (3242112423).
The spelling of 2022010221 in words is "two billion, twenty-two million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •