Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …0011011100011110111111 |
3 | 1102222122022120222220011100 |
4 | 2200032302303130132333 |
5 | 2420401012224310421 |
6 | 35230214541224143 |
7 | 2214342604214154 |
oct | 240166263343677 |
9 | 42878276886140 |
10 | 11011001010111 |
11 | 3565815017703 |
12 | 129a009b62053 |
13 | 61b4436133ab |
14 | 2a0d1462a22b |
15 | 14164c397c26 |
hex | a03b2cdc7bf |
11011001010111 has 12 divisors (see below), whose sum is σ = 15905710815592. Its totient is φ = 7340237380656.
The previous prime is 11011001010109. The next prime is 11011001010137. The reversal of 11011001010111 is 11101010011011.
It is not a de Polignac number, because 11011001010111 - 21 = 11011001010109 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 = 11011001010093 and 11011001010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011001010151) 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, 35667721 + ... + 35975106.
Almost surely, 211011001010111 is an apocalyptic number.
11011001010111 is a deficient number, since it is larger than the sum of its proper divisors (4894709805481).
11011001010111 is a wasteful number, since it uses less digits than its factorization.
11011001010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71659910 (or 71659907 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11011001010111 its reverse (11101010011011), we get a palindrome (22112011021122).
The spelling of 11011001010111 in words is "eleven trillion, eleven billion, one million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •