Base | Representation |
---|---|
bin | 11101011011001111110… |
… | …100010010100001110011 |
3 | 21011022110002211021022100 |
4 | 131123033310102201303 |
5 | 231112301013021321 |
6 | 4144541043311443 |
7 | 266044022526321 |
oct | 35331764224163 |
9 | 7138402737270 |
10 | 2022121220211 |
11 | 70a638791a64 |
12 | 287a9837b583 |
13 | 1188ba5497a1 |
14 | 6dc2a786d11 |
15 | 379000a3326 |
hex | 1d6cfd12873 |
2022121220211 has 12 divisors (see below), whose sum is σ = 3015062464960. Its totient is φ = 1304594335440.
The previous prime is 2022121220209. The next prime is 2022121220221. The reversal of 2022121220211 is 1120221212202.
It is a happy number.
2022121220211 is a `hidden beast` number, since 2 + 0 + 221 + 212 + 20 + 211 = 666.
It is not a de Polignac number, because 2022121220211 - 21 = 2022121220209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2022121220221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3623872876 + ... + 3623873433.
Almost surely, 22022121220211 is an apocalyptic number.
2022121220211 is a deficient number, since it is larger than the sum of its proper divisors (992941244749).
2022121220211 is a wasteful number, since it uses less digits than its factorization.
2022121220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7247746346 (or 7247746343 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2022121220211 its reverse (1120221212202), we get a palindrome (3142342432413).
It can be divided in two parts, 20221212202 and 11, that multiplied together give a palindrome (222433334222).
The spelling of 2022121220211 in words is "two trillion, twenty-two billion, one hundred twenty-one million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •