Base | Representation |
---|---|
bin | 10100101011011101… |
… | …10001010001010011 |
3 | 1001122201101001020000 |
4 | 22111232301101103 |
5 | 140214103001321 |
6 | 5033350221043 |
7 | 542055305361 |
oct | 122556612123 |
9 | 31581331200 |
10 | 11102000211 |
11 | 4787876095 |
12 | 219a054783 |
13 | 107c0bb6c3 |
14 | 774662631 |
15 | 44e9db826 |
hex | 295bb1453 |
11102000211 has 10 divisors (see below), whose sum is σ = 16584469572. Its totient is φ = 7401333420.
The previous prime is 11102000201. The next prime is 11102000233. The reversal of 11102000211 is 11200020111.
It is a happy number.
11102000211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11102000211 - 25 = 11102000179 is a prime.
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 = 11102000193 and 11102000202.
It is not an unprimeable number, because it can be changed into a prime (11102000201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 68530785 + ... + 68530946.
Almost surely, 211102000211 is an apocalyptic number.
11102000211 is a deficient number, since it is larger than the sum of its proper divisors (5482469361).
11102000211 is an equidigital number, since it uses as much as digits as its factorization.
11102000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137061743 (or 137061734 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11102000211 its reverse (11200020111), we get a palindrome (22302020322).
The spelling of 11102000211 in words is "eleven billion, one hundred two million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •