Base | Representation |
---|---|
bin | 11001010010001100000001… |
… | …011011000001100000100100 |
3 | 112120201201021102120001220122 |
4 | 121102030001123001200210 |
5 | 104033404143130401040 |
6 | 1032301013324021112 |
7 | 32265002664231305 |
oct | 3122140133014044 |
9 | 476651242501818 |
10 | 111201022122020 |
11 | 324830a7a8a726 |
12 | 1057b605391798 |
13 | 4a0829957059c |
14 | 1d662300d47ac |
15 | ccc8d8eee1b5 |
hex | 6523016c1824 |
111201022122020 has 24 divisors (see below), whose sum is σ = 234001658071104. Its totient is φ = 44389073303136.
The previous prime is 111201022121989. The next prime is 111201022122049. The reversal of 111201022122020 is 20221220102111.
It is a self number, because there is not a number n which added to its sum of digits gives 111201022122020.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5708461622 + ... + 5708481101.
It is an arithmetic number, because the mean of its divisors is an integer number (9750069086296).
Almost surely, 2111201022122020 is an apocalyptic number.
111201022122020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111201022122020 is an abundant number, since it is smaller than the sum of its proper divisors (122800635949084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111201022122020 is a wasteful number, since it uses less digits than its factorization.
111201022122020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11416943219 (or 11416943217 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 111201022122020 its reverse (20221220102111), we get a palindrome (131422242224131).
The spelling of 111201022122020 in words is "one hundred eleven trillion, two hundred one billion, twenty-two million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •