Base | Representation |
---|---|
bin | 1001001100001110010100… |
… | …00011110000111001010110 |
3 | 2122120011200001102200122100 |
4 | 10212013022003300321112 |
5 | 10122120030021041042 |
6 | 110552522513142530 |
7 | 4154132436606450 |
oct | 446071203607126 |
9 | 78504601380570 |
10 | 20211211112022 |
11 | 6492587849677 |
12 | 232509985aa46 |
13 | b37ba81a55b8 |
14 | 4dc3292852d0 |
15 | 250b1769b24c |
hex | 1261ca0f0e56 |
20211211112022 has 48 divisors (see below), whose sum is σ = 50047289660160. Its totient is φ = 5774576224176.
The previous prime is 20211211111943. The next prime is 20211211112051. The reversal of 20211211112022 is 22021111211202.
It is a super-2 number, since 2×202112111120222 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 20211211111986 and 20211211112004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13417479 + ... + 14847597.
It is an arithmetic number, because the mean of its divisors is an integer number (1042651867920).
Almost surely, 220211211112022 is an apocalyptic number.
20211211112022 is an abundant number, since it is smaller than the sum of its proper divisors (29836078548138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20211211112022 is a wasteful number, since it uses less digits than its factorization.
20211211112022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1542297 (or 1542294 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 20211211112022 its reverse (22021111211202), we get a palindrome (42232322323224).
The spelling of 20211211112022 in words is "twenty trillion, two hundred eleven billion, two hundred eleven million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •