Base | Representation |
---|---|
bin | 1010000110110011011101… |
… | …1111001100111100100000 |
3 | 1110100022001011201100120022 |
4 | 2201230313133030330200 |
5 | 2424024344344233440 |
6 | 35344442034533012 |
7 | 2224546666536623 |
oct | 241546737147440 |
9 | 43308034640508 |
10 | 11112011321120 |
11 | 35a4639779386 |
12 | 12b56ba137168 |
13 | 627b205302a8 |
14 | 2a5b7791ddba |
15 | 1440b014dcb5 |
hex | a1b377ccf20 |
11112011321120 has 24 divisors (see below), whose sum is σ = 26252126746524. Its totient is φ = 4444804528384.
The previous prime is 11112011321057. The next prime is 11112011321153. The reversal of 11112011321120 is 2112311021111.
It can be written as a sum of positive squares in 2 ways, for example, as 11054374835344 + 57636485776 = 3324812^2 + 240076^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34725035219 + ... + 34725035538.
Almost surely, 211112011321120 is an apocalyptic number.
11112011321120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11112011321120 is an abundant number, since it is smaller than the sum of its proper divisors (15140115425404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112011321120 is an equidigital number, since it uses as much as digits as its factorization.
11112011321120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69450070772 (or 69450070764 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 11112011321120 its reverse (2112311021111), we get a palindrome (13224322342231).
The spelling of 11112011321120 in words is "eleven trillion, one hundred twelve billion, eleven million, three hundred twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •