Base | Representation |
---|---|
bin | 1010000110000111001000… |
… | …0111101100010101110000 |
3 | 1110022011022202111021222111 |
4 | 2201201302013230111300 |
5 | 2423331011142041422 |
6 | 35335153054415104 |
7 | 2223646035121360 |
oct | 241416207542560 |
9 | 43264282437874 |
10 | 11100110112112 |
11 | 359a59186295a |
12 | 12b3338501494 |
13 | 6269749a7b98 |
14 | 2a536909a9a0 |
15 | 143b153e4a77 |
hex | a18721ec570 |
11100110112112 has 20 divisors (see below), whose sum is σ = 24578815248496. Its totient is φ = 4757190048000.
The previous prime is 11100110112109. The next prime is 11100110112127. The reversal of 11100110112112 is 21121101100111.
It is a super-2 number, since 2×111001101121122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11100110112092 and 11100110112101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 49554062889 + ... + 49554063112.
Almost surely, 211100110112112 is an apocalyptic number.
It is an amenable number.
11100110112112 is an abundant number, since it is smaller than the sum of its proper divisors (13478705136384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100110112112 is an equidigital number, since it uses as much as digits as its factorization.
11100110112112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99108126016 (or 99108126010 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11100110112112 its reverse (21121101100111), we get a palindrome (32221211212223).
The spelling of 11100110112112 in words is "eleven trillion, one hundred billion, one hundred ten million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •