Base | Representation |
---|---|
bin | 10100101011010101… |
… | …11111100100100011 |
3 | 1001122122111202012100 |
4 | 22111222333210203 |
5 | 140213324311321 |
6 | 5033313101443 |
7 | 542044013154 |
oct | 122552774443 |
9 | 31578452170 |
10 | 11101010211 |
11 | 478725a305 |
12 | 2199857883 |
13 | 107bb32bc5 |
14 | 77448592b |
15 | 44e893326 |
hex | 295abf923 |
11101010211 has 12 divisors (see below), whose sum is σ = 16468165792. Its totient is φ = 7200655056.
The previous prime is 11101010201. The next prime is 11101010231. The reversal of 11101010211 is 11201010111.
It is not a de Polignac number, because 11101010211 - 27 = 11101010083 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 = 11101010193 and 11101010202.
It is not an unprimeable number, because it can be changed into a prime (11101010201) 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, 16667851 + ... + 16668516.
Almost surely, 211101010211 is an apocalyptic number.
11101010211 is a deficient number, since it is larger than the sum of its proper divisors (5367155581).
11101010211 is a wasteful number, since it uses less digits than its factorization.
11101010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33336410 (or 33336407 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11101010211 its reverse (11201010111), we get a palindrome (22302020322).
The spelling of 11101010211 in words is "eleven billion, one hundred one million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •