Base | Representation |
---|---|
bin | 10100110111001010… |
… | …11000100100000011 |
3 | 1001220120011021010202 |
4 | 22123211120210003 |
5 | 140414222444021 |
6 | 5051215115415 |
7 | 544360104044 |
oct | 123345304403 |
9 | 31816137122 |
10 | 11200203011 |
11 | 482824a328 |
12 | 2206b12b6b |
13 | 109655317a |
14 | 7837068cb |
15 | 458438a0b |
hex | 29b958903 |
11200203011 has 4 divisors (see below), whose sum is σ = 11789687400. Its totient is φ = 10610718624.
The previous prime is 11200202963. The next prime is 11200203017. The reversal of 11200203011 is 11030200211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11030200211 = 953 ⋅11574187.
It is a cyclic number.
It is not a de Polignac number, because 11200203011 - 26 = 11200202947 is a prime.
It is a super-2 number, since 2×112002030112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11200202983 and 11200203001.
It is not an unprimeable number, because it can be changed into a prime (11200203017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 294742166 + ... + 294742203.
It is an arithmetic number, because the mean of its divisors is an integer number (2947421850).
Almost surely, 211200203011 is an apocalyptic number.
11200203011 is a deficient number, since it is larger than the sum of its proper divisors (589484389).
11200203011 is an equidigital number, since it uses as much as digits as its factorization.
11200203011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589484388.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 11200203011 its reverse (11030200211), we get a palindrome (22230403222).
The spelling of 11200203011 in words is "eleven billion, two hundred million, two hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •