Base | Representation |
---|---|
bin | 10100011111011011… |
… | …10111100011011111 |
3 | 1001101200111210212002 |
4 | 22033231313203133 |
5 | 140012240204021 |
6 | 5015343432515 |
7 | 536421545222 |
oct | 121755674337 |
9 | 31350453762 |
10 | 11001100511 |
11 | 473591a705 |
12 | 21702b573b |
13 | 106422153b |
14 | 7650b95b9 |
15 | 445c0a50b |
hex | 28fb778df |
11001100511 has 8 divisors (see below), whose sum is σ = 11153617440. Its totient is φ = 10848632832.
The previous prime is 11001100499. The next prime is 11001100531. The reversal of 11001100511 is 11500110011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11001100511 - 226 = 10933991647 is a prime.
It is a super-2 number, since 2×110011005112 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11001100492 and 11001100501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001100531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 889055 + ... + 901343.
It is an arithmetic number, because the mean of its divisors is an integer number (1394202180).
Almost surely, 211001100511 is an apocalyptic number.
11001100511 is a deficient number, since it is larger than the sum of its proper divisors (152516929).
11001100511 is a wasteful number, since it uses less digits than its factorization.
11001100511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24625.
The product of its (nonzero) digits is 5, while the sum is 11.
Adding to 11001100511 its reverse (11500110011), we get a palindrome (22501210522).
The spelling of 11001100511 in words is "eleven billion, one million, one hundred thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •