Base | Representation |
---|---|
bin | 1010000110101111101111… |
… | …0011011110000001110011 |
3 | 1110100012110101120000121100 |
4 | 2201223323303132001303 |
5 | 2424020322030013021 |
6 | 35344154425055443 |
7 | 2224513120500204 |
oct | 241537363360163 |
9 | 43305411500540 |
10 | 11111010001011 |
11 | 35a41755337a8 |
12 | 12b547a927583 |
13 | 6279c0c5029b |
14 | 2a5ac094b5ab |
15 | 1440522ab626 |
hex | a1afbcde073 |
11111010001011 has 12 divisors (see below), whose sum is σ = 16073083982488. Its totient is φ = 7396333547904.
The previous prime is 11111010000991. The next prime is 11111010001019. The reversal of 11111010001011 is 11010001011111.
It is a de Polignac number, because none of the positive numbers 2k-11111010001011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11111010000984 and 11111010001002.
It is not an unprimeable number, because it can be changed into a prime (11111010001019) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 917198005 + ... + 917210118.
Almost surely, 211111010001011 is an apocalyptic number.
11111010001011 is a deficient number, since it is larger than the sum of its proper divisors (4962073981477).
11111010001011 is a wasteful number, since it uses less digits than its factorization.
11111010001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1834408802 (or 1834408799 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11111010001011 its reverse (11010001011111), we get a palindrome (22121011012122).
It can be divided in two parts, 111 and 11010001011, that multiplied together give a palindrome (1222110112221).
The spelling of 11111010001011 in words is "eleven trillion, one hundred eleven billion, ten million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •