Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …0100010110001001000000 |
3 | 1110022020122112200122201002 |
4 | 2201202213310112021000 |
5 | 2423334332304310422 |
6 | 35335422320031132 |
7 | 2224010254460222 |
oct | 241424764261100 |
9 | 43266575618632 |
10 | 11101011010112 |
11 | 359aa04348961 |
12 | 12b354a1624a8 |
13 | 626a8952721a |
14 | 2a54129ac412 |
15 | 143b6954c692 |
hex | a18a7d16240 |
11101011010112 has 28 divisors (see below), whose sum is σ = 22140388894140. Its totient is φ = 5522330343936.
The previous prime is 11101011010097. The next prime is 11101011010153. The reversal of 11101011010112 is 21101011010111.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 8853338407936 + 2247672602176 = 2975456^2 + 1499224^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11101011010093 and 11101011010102.
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 3 ways as a sum of consecutive naturals, for example, 440224187 + ... + 440249402.
Almost surely, 211101011010112 is an apocalyptic number.
It is an amenable number.
11101011010112 is a deficient number, since it is larger than the sum of its proper divisors (11039377884028).
11101011010112 is an equidigital number, since it uses as much as digits as its factorization.
11101011010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880473798 (or 880473788 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11101011010112 its reverse (21101011010111), we get a palindrome (32202022020223).
Subtracting 11101011010112 from its reverse (21101011010111), we obtain a palindrome (9999999999999).
The spelling of 11101011010112 in words is "eleven trillion, one hundred one billion, eleven million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •