Base | Representation |
---|---|
bin | 10100011111011011… |
… | …00100001010110111 |
3 | 1001101200100202221100 |
4 | 22033231210022313 |
5 | 140012230133421 |
6 | 5015342021143 |
7 | 536421064563 |
oct | 121755441267 |
9 | 31350322840 |
10 | 11001021111 |
11 | 4735875a93 |
12 | 21702777b3 |
13 | 10641c4362 |
14 | 7650986a3 |
15 | 445be1c26 |
hex | 28fb642b7 |
11001021111 has 12 divisors (see below), whose sum is σ = 15901740400. Its totient is φ = 7328763360.
The previous prime is 11001021107. The next prime is 11001021169. The reversal of 11001021111 is 11112010011.
It is not a de Polignac number, because 11001021111 - 22 = 11001021107 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 = 11001021093 and 11001021102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001061111) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 424270 + ... + 449451.
Almost surely, 211001021111 is an apocalyptic number.
11001021111 is a deficient number, since it is larger than the sum of its proper divisors (4900719289).
11001021111 is a wasteful number, since it uses less digits than its factorization.
11001021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 875126 (or 875123 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11001021111 its reverse (11112010011), we get a palindrome (22113031122).
The spelling of 11001021111 in words is "eleven billion, one million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.194 sec. • engine limits •