Base | Representation |
---|---|
bin | 1010000110101111101111… |
… | …0011011110000011010110 |
3 | 1110100012110101120000202000 |
4 | 2201223323303132003112 |
5 | 2424020322030013420 |
6 | 35344154425100130 |
7 | 2224513120500405 |
oct | 241537363360326 |
9 | 43305411500660 |
10 | 11111010001110 |
11 | 35a4175533888 |
12 | 12b547a927646 |
13 | 6279c0c50346 |
14 | 2a5ac094b63c |
15 | 1440522ab690 |
hex | a1afbcde0d6 |
11111010001110 has 32 divisors (see below), whose sum is σ = 29629360003680. Its totient is φ = 2962936000224.
The previous prime is 11111010001109. The next prime is 11111010001139. The reversal of 11111010001110 is 1110001011111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11111010001092 and 11111010001101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20575944177 + ... + 20575944716.
It is an arithmetic number, because the mean of its divisors is an integer number (925917500115).
Almost surely, 211111010001110 is an apocalyptic number.
11111010001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11111010001110 is an abundant number, since it is smaller than the sum of its proper divisors (18518350002570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111010001110 is a wasteful number, since it uses less digits than its factorization.
11111010001110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41151888909 (or 41151888903 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11111010001110 its reverse (1110001011111), we get a palindrome (12221011012221).
The spelling of 11111010001110 in words is "eleven trillion, one hundred eleven billion, ten million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •