Base | Representation |
---|---|
bin | 10100011111010100… |
… | …01000101010011011 |
3 | 1001101121200002121100 |
4 | 22033222020222123 |
5 | 140012012401021 |
6 | 5015310442443 |
7 | 536410331364 |
oct | 121752105233 |
9 | 31347602540 |
10 | 11000122011 |
11 | 473531152a |
12 | 216bb03423 |
13 | 1063c6b048 |
14 | 764d02b6b |
15 | 445ab5626 |
hex | 28fa88a9b |
11000122011 has 12 divisors (see below), whose sum is σ = 15890345640. Its totient is φ = 7332823680.
The previous prime is 11000121997. The next prime is 11000122027. The reversal of 11000122011 is 11022100011.
It is a happy number.
11000122011 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 11000122011 - 210 = 11000120987 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 = 11000121984 and 11000122002.
It is not an unprimeable number, because it can be changed into a prime (11000122031) 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 11 ways as a sum of consecutive naturals, for example, 89080 + ... + 173018.
It is an arithmetic number, because the mean of its divisors is an integer number (1324195470).
Almost surely, 211000122011 is an apocalyptic number.
11000122011 is a deficient number, since it is larger than the sum of its proper divisors (4890223629).
11000122011 is a wasteful number, since it uses less digits than its factorization.
11000122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98506 (or 98503 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11000122011 its reverse (11022100011), we get a palindrome (22022222022).
The spelling of 11000122011 in words is "eleven billion, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •