Base | Representation |
---|---|
bin | 10100101100011010… |
… | …10111011110010011 |
3 | 1001200021110112200200 |
4 | 22112031113132103 |
5 | 140223131133021 |
6 | 5034234150243 |
7 | 542213422545 |
oct | 122615273623 |
9 | 31607415620 |
10 | 11110021011 |
11 | 4791354251 |
12 | 21a0882383 |
13 | 108096943b |
14 | 77574d695 |
15 | 450573126 |
hex | 296357793 |
11110021011 has 12 divisors (see below), whose sum is σ = 16049557680. Its totient is φ = 7405873200.
The previous prime is 11110021009. The next prime is 11110021061. The reversal of 11110021011 is 11012001111.
It is not a de Polignac number, because 11110021011 - 21 = 11110021009 is a prime.
It is a super-2 number, since 2×111100210112 (a number of 21 digits) contains 22 as substring.
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 = 11110020984 and 11110021002.
It is not an unprimeable number, because it can be changed into a prime (11110021001) 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, 26770 + ... + 151448.
It is an arithmetic number, because the mean of its divisors is an integer number (1337463140).
Almost surely, 211110021011 is an apocalyptic number.
11110021011 is a deficient number, since it is larger than the sum of its proper divisors (4939536669).
11110021011 is a wasteful number, since it uses less digits than its factorization.
11110021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134586 (or 134583 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11110021011 its reverse (11012001111), we get a palindrome (22122022122).
The spelling of 11110021011 in words is "eleven billion, one hundred ten million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •