Base | Representation |
---|---|
bin | 1010000110101100010110… |
… | …0100011110011111111000 |
3 | 1110100010002222102022121002 |
4 | 2201223011210132133320 |
5 | 2424011441111213422 |
6 | 35343524242504132 |
7 | 2224451431456625 |
oct | 241530544363770 |
9 | 43303088368532 |
10 | 11110100101112 |
11 | 35a384895a511 |
12 | 12b5266065048 |
13 | 6278a759b78c |
14 | 2a5a35b7534c |
15 | 143eec476692 |
hex | a1ac591e7f8 |
11110100101112 has 16 divisors (see below), whose sum is σ = 20983491981360. Its totient is φ = 5514502239424.
The previous prime is 11110100101099. The next prime is 11110100101231. The reversal of 11110100101112 is 21110100101111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11110100101093 and 11110100101102.
It is a congruent number.
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, 5068475228 + ... + 5068477419.
It is an arithmetic number, because the mean of its divisors is an integer number (1311468248835).
Almost surely, 211110100101112 is an apocalyptic number.
It is an amenable number.
11110100101112 is a deficient number, since it is larger than the sum of its proper divisors (9873391880248).
11110100101112 is a wasteful number, since it uses less digits than its factorization.
11110100101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10136952790 (or 10136952786 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11110100101112 its reverse (21110100101111), we get a palindrome (32220200202223).
Subtracting 11110100101112 from its reverse (21110100101111), we obtain a palindrome (9999999999999).
The spelling of 11110100101112 in words is "eleven trillion, one hundred ten billion, one hundred million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •