Base | Representation |
---|---|
bin | 1010000110101111101101… |
… | …0001001010111101011011 |
3 | 1110100012102202122020021100 |
4 | 2201223323101022331123 |
5 | 2424020312224310021 |
6 | 35344153504242443 |
7 | 2224512651202320 |
oct | 241537321127533 |
9 | 43305382566240 |
10 | 11111001010011 |
11 | 35a4170452721 |
12 | 12b5477910423 |
13 | 6279bc122a76 |
14 | 2a5abd68ab47 |
15 | 1440515d2626 |
hex | a1afb44af5b |
11111001010011 has 24 divisors (see below), whose sum is σ = 18343964787200. Its totient is φ = 6348452903856.
The previous prime is 11111001010007. The next prime is 11111001010013. The reversal of 11111001010011 is 11001010011111.
It is not a de Polignac number, because 11111001010011 - 22 = 11111001010007 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 = 11111001009975 and 11111001010002.
It is not an unprimeable number, because it can be changed into a prime (11111001010013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9006565 + ... + 10165638.
Almost surely, 211111001010011 is an apocalyptic number.
11111001010011 is a deficient number, since it is larger than the sum of its proper divisors (7232963777189).
11111001010011 is a wasteful number, since it uses less digits than its factorization.
11111001010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19181415 (or 19181412 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11111001010011 its reverse (11001010011111), we get a palindrome (22112011021122).
It can be divided in two parts, 111 and 11001010011, that multiplied together give a palindrome (1221112111221).
The spelling of 11111001010011 in words is "eleven trillion, one hundred eleven billion, one million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •