Base | Representation |
---|---|
bin | 10100100000101000… |
… | …11001011111110011 |
3 | 1001102101111222010200 |
4 | 22100110121133303 |
5 | 140022331413021 |
6 | 5020344130243 |
7 | 536603443566 |
oct | 122024313763 |
9 | 31371458120 |
10 | 11011201011 |
11 | 4740599328 |
12 | 2173766983 |
13 | 1066349a75 |
14 | 7665884dd |
15 | 446a53126 |
hex | 2905197f3 |
11011201011 has 24 divisors (see below), whose sum is σ = 16035192576. Its totient is φ = 7280895600.
The previous prime is 11011200979. The next prime is 11011201013. The reversal of 11011201011 is 11010211011.
11011201011 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 11011201011 - 25 = 11011200979 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 = 11011200984 and 11011201002.
It is not an unprimeable number, because it can be changed into a prime (11011201013) 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 23 ways as a sum of consecutive naturals, for example, 922266 + ... + 934128.
It is an arithmetic number, because the mean of its divisors is an integer number (668133024).
Almost surely, 211011201011 is an apocalyptic number.
11011201011 is a deficient number, since it is larger than the sum of its proper divisors (5023991565).
11011201011 is a wasteful number, since it uses less digits than its factorization.
11011201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12703 (or 12700 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11011201011 its reverse (11010211011), we get a palindrome (22021412022).
The spelling of 11011201011 in words is "eleven billion, eleven million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •