Base | Representation |
---|---|
bin | 1010000110110000110100… |
… | …1101110100001010111000 |
3 | 1110100020012202020012200121 |
4 | 2201230031031310022320 |
5 | 2424021421320320440 |
6 | 35344243422143024 |
7 | 2224523265454336 |
oct | 241541515641270 |
9 | 43306182205617 |
10 | 11111302120120 |
11 | 35a4305415154 |
12 | 12b5540721a74 |
13 | 627a3961bc27 |
14 | 2a5b0b66cb56 |
15 | 14406cc6034a |
hex | a1b0d3742b8 |
11111302120120 has 16 divisors (see below), whose sum is σ = 25000429770360. Its totient is φ = 4444520848032.
The previous prime is 11111302120091. The next prime is 11111302120151. The reversal of 11111302120120 is 2102120311111.
It is a happy number.
It is a super-2 number, since 2×111113021201202 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11111302120094 and 11111302120103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 138891276462 + ... + 138891276541.
Almost surely, 211111302120120 is an apocalyptic number.
11111302120120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11111302120120 is an abundant number, since it is smaller than the sum of its proper divisors (13889127650240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111302120120 is a wasteful number, since it uses less digits than its factorization.
11111302120120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277782553014 (or 277782553010 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 11111302120120 its reverse (2102120311111), we get a palindrome (13213422431231).
The spelling of 11111302120120 in words is "eleven trillion, one hundred eleven billion, three hundred two million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •