Base | Representation |
---|---|
bin | 11101011011001111110… |
… | …011111010000111011101 |
3 | 21011022110002122012011000 |
4 | 131123033303322013131 |
5 | 231112301001321341 |
6 | 4144541041220513 |
7 | 266044021631646 |
oct | 35331763720735 |
9 | 7138402565130 |
10 | 2022121120221 |
11 | 70a638723924 |
12 | 287a98331739 |
13 | 1188ba513117 |
14 | 6dc2a75c6cd |
15 | 379000838b6 |
hex | 1d6cfcfa1dd |
2022121120221 has 32 divisors (see below), whose sum is σ = 3048611126400. Its totient is φ = 1324341152640.
The previous prime is 2022121120211. The next prime is 2022121120241. The reversal of 2022121120221 is 1220211212202.
It is a happy number.
2022121120221 is a `hidden beast` number, since 202 + 2 + 121 + 120 + 221 = 666.
It is not a de Polignac number, because 2022121120221 - 210 = 2022121119197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2022121120194 and 2022121120203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022121120211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 573610 + ... + 2091236.
It is an arithmetic number, because the mean of its divisors is an integer number (95269097700).
Almost surely, 22022121120221 is an apocalyptic number.
It is an amenable number.
2022121120221 is a deficient number, since it is larger than the sum of its proper divisors (1026490006179).
2022121120221 is a wasteful number, since it uses less digits than its factorization.
2022121120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1518506 (or 1518500 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2022121120221 its reverse (1220211212202), we get a palindrome (3242332332423).
The spelling of 2022121120221 in words is "two trillion, twenty-two billion, one hundred twenty-one million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •