Base | Representation |
---|---|
bin | 1010000000110111110110… |
… | …1101010100010000101000 |
3 | 1102222120000111210121122211 |
4 | 2200031331231110100220 |
5 | 2420342201203223422 |
6 | 35225550320254504 |
7 | 2214311536436425 |
oct | 240157555242050 |
9 | 42876014717584 |
10 | 11010110211112 |
11 | 35653a81aa191 |
12 | 12999bb771434 |
13 | 61b330bbb9ac |
14 | 2a0c6c1c6d4c |
15 | 1415e9087577 |
hex | a037db54428 |
11010110211112 has 16 divisors (see below), whose sum is σ = 20648357474400. Its totient is φ = 5503881551280.
The previous prime is 11010110211073. The next prime is 11010110211167. The reversal of 11010110211112 is 21111201101011.
It is a junction number, because it is equal to n+sod(n) for n = 11010110211092 and 11010110211101.
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, 146654412 + ... + 146729467.
It is an arithmetic number, because the mean of its divisors is an integer number (1290522342150).
Almost surely, 211010110211112 is an apocalyptic number.
It is an amenable number.
11010110211112 is a deficient number, since it is larger than the sum of its proper divisors (9638247263288).
11010110211112 is a wasteful number, since it uses less digits than its factorization.
11010110211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293388576 (or 293388572 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11010110211112 its reverse (21111201101011), we get a palindrome (32121311312123).
The spelling of 11010110211112 in words is "eleven trillion, ten billion, one hundred ten million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •