Base | Representation |
---|---|
bin | 10100011111011010… |
… | …11111000001001011 |
3 | 1001101200022200222212 |
4 | 22033231133001023 |
5 | 140012224000021 |
6 | 5015341335335 |
7 | 536420646221 |
oct | 121755370113 |
9 | 31350280885 |
10 | 11001000011 |
11 | 4735861151 |
12 | 217026754b |
13 | 10641b7881 |
14 | 765090b11 |
15 | 445bda85b |
hex | 28fb5f04b |
11001000011 has 4 divisors (see below), whose sum is σ = 11002358472. Its totient is φ = 10999641552.
The previous prime is 11001000001. The next prime is 11001000047. The reversal of 11001000011 is 11000010011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001000011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11000999959 and 11001000004.
It is not an unprimeable number, because it can be changed into a prime (11001000001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 667010 + ... + 683303.
It is an arithmetic number, because the mean of its divisors is an integer number (2750589618).
Almost surely, 211001000011 is an apocalyptic number.
11001000011 is a deficient number, since it is larger than the sum of its proper divisors (1358461).
11001000011 is an equidigital number, since it uses as much as digits as its factorization.
11001000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1358460.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 11001000011 its reverse (11000010011), we get a palindrome (22001010022).
It can be divided in two parts, 110010000 and 11, that added together give a palindrome (110010011).
The spelling of 11001000011 in words is "eleven billion, one million, eleven", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •