Base | Representation |
---|---|
bin | 1001001100011110111001… |
… | …00010111001111111010100 |
3 | 2122121000122022112000102021 |
4 | 10212033130202321333110 |
5 | 10122241241431401322 |
6 | 111000554005022524 |
7 | 4154566130243440 |
oct | 446173442717724 |
9 | 78530568460367 |
10 | 20220111200212 |
11 | 64963346a9660 |
12 | 23269623b4a44 |
13 | b38996043281 |
14 | 4dc9312cd820 |
15 | 250e88bde4c7 |
hex | 1263dc8b9fd4 |
20220111200212 has 48 divisors (see below), whose sum is σ = 44118314150400. Its totient is φ = 7877660421600.
The previous prime is 20220111200209. The next prime is 20220111200231. The reversal of 20220111200212 is 21200211102202.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6780787 + ... + 9296197.
It is an arithmetic number, because the mean of its divisors is an integer number (919131544800).
Almost surely, 220220111200212 is an apocalyptic number.
20220111200212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
20220111200212 is an abundant number, since it is smaller than the sum of its proper divisors (23898202950188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20220111200212 is a wasteful number, since it uses less digits than its factorization.
20220111200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2541532 (or 2541530 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20220111200212 its reverse (21200211102202), we get a palindrome (41420322302414).
It can be divided in two parts, 2022011 and 1200212, that added together give a palindrome (3222223).
The spelling of 20220111200212 in words is "twenty trillion, two hundred twenty billion, one hundred eleven million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •