Base | Representation |
---|---|
bin | 10100100000100001… |
… | …00101000111001011 |
3 | 1001102022122010000121 |
4 | 22100100211013023 |
5 | 140022102400021 |
6 | 5020310444111 |
7 | 536562104326 |
oct | 122020450713 |
9 | 31368563017 |
10 | 11010200011 |
11 | 473aa75258 |
12 | 2173363637 |
13 | 1066089265 |
14 | 7663a77bd |
15 | 446906741 |
hex | 2904251cb |
11010200011 has 4 divisors (see below), whose sum is σ = 11012396992. Its totient is φ = 11008003032.
The previous prime is 11010199997. The next prime is 11010200017. The reversal of 11010200011 is 11000201011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11010200011 - 25 = 11010199979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11010199967 and 11010200003.
It is not an unprimeable number, because it can be changed into a prime (11010200017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1090956 + ... + 1101001.
It is an arithmetic number, because the mean of its divisors is an integer number (2753099248).
Almost surely, 211010200011 is an apocalyptic number.
11010200011 is a deficient number, since it is larger than the sum of its proper divisors (2196981).
11010200011 is an equidigital number, since it uses as much as digits as its factorization.
11010200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2196980.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11010200011 its reverse (11000201011), we get a palindrome (22010401022).
The spelling of 11010200011 in words is "eleven billion, ten million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •