Base | Representation |
---|---|
bin | 1010000110101100011000… |
… | …1110000110000011000100 |
3 | 1110100010010201221121011110 |
4 | 2201223012032012003010 |
5 | 2424012001404323022 |
6 | 35343525312405020 |
7 | 2224451623266126 |
oct | 241530616060304 |
9 | 43303121847143 |
10 | 11110111011012 |
11 | 35a3854031262 |
12 | 12b5269846770 |
13 | 6278a991b540 |
14 | 2a5a373b5216 |
15 | 143eed3ce00c |
hex | a1ac63860c4 |
11110111011012 has 24 divisors (see below), whose sum is σ = 27917714848576. Its totient is φ = 3418495695648.
The previous prime is 11110111011007. The next prime is 11110111011037. The reversal of 11110111011012 is 21011011101111.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35609330008 + ... + 35609330319.
Almost surely, 211110111011012 is an apocalyptic number.
11110111011012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11110111011012 is an abundant number, since it is smaller than the sum of its proper divisors (16807603837564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110111011012 is a wasteful number, since it uses less digits than its factorization.
11110111011012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71218660347 (or 71218660345 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 11110111011012 its reverse (21011011101111), we get a palindrome (32121122112123).
Subtracting 11110111011012 from its reverse (21011011101111), we obtain a palindrome (9900900090099).
The spelling of 11110111011012 in words is "eleven trillion, one hundred ten billion, one hundred eleven million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •