Base | Representation |
---|---|
bin | 1010000000111111010001… |
… | …1000000010011111100110 |
3 | 1102222202011021001100222221 |
4 | 2200033310120002133212 |
5 | 2420410240341401042 |
6 | 35230520040342554 |
7 | 2214412063054420 |
oct | 240176430023746 |
9 | 42882137040887 |
10 | 11012101122022 |
11 | 3566229aa9000 |
12 | 129a276474a5a |
13 | 61b58a502ca0 |
14 | 2a0dba797810 |
15 | 1416b3c51d67 |
hex | a03f46027e6 |
11012101122022 has 128 divisors (see below), whose sum is σ = 22728121307136. Its totient is φ = 3895466256000.
The previous prime is 11012101121929. The next prime is 11012101122023. The reversal of 11012101122022 is 22022110121011.
It is a super-2 number, since 2×110121011220222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11012101121987 and 11012101122005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012101122023) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14404147 + ... + 15149377.
It is an arithmetic number, because the mean of its divisors is an integer number (177563447712).
Almost surely, 211012101122022 is an apocalyptic number.
11012101122022 is an abundant number, since it is smaller than the sum of its proper divisors (11716020185114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012101122022 is a wasteful number, since it uses less digits than its factorization.
11012101122022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 745347 (or 745325 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11012101122022 its reverse (22022110121011), we get a palindrome (33034211243033).
The spelling of 11012101122022 in words is "eleven trillion, twelve billion, one hundred one million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •