Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …010110011101001001011 |
3 | 10220011021221221120111012 |
4 | 100000131022303221023 |
5 | 121010300224000021 |
6 | 2201200010554135 |
7 | 142321023141014 |
oct | 20003512635113 |
9 | 3804257846435 |
10 | 1100001000011 |
11 | 394564984351 |
12 | 15923013894b |
13 | 7c9640684b4 |
14 | 3b35168800b |
15 | 1d930aec35b |
hex | 1001d2b3a4b |
1100001000011 has 4 divisors (see below), whose sum is σ = 1101155251752. Its totient is φ = 1098846748272.
The previous prime is 1100000999969. The next prime is 1100001000023.
1100001000011 is nontrivially palindromic in base 10.
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-1100001000011 is a prime.
1100001000011 is a strobogrammatic number because it is the same when read upside-down.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100000999959 and 1100001000004.
It is not an unprimeable number, because it can be changed into a prime (1100001000031) 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 3 ways as a sum of consecutive naturals, for example, 577124441 + ... + 577126346.
It is an arithmetic number, because the mean of its divisors is an integer number (275288812938).
Almost surely, 21100001000011 is an apocalyptic number.
1100001000011 is a deficient number, since it is larger than the sum of its proper divisors (1154251741).
1100001000011 is an equidigital number, since it uses as much as digits as its factorization.
1100001000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1154251740.
The product of its (nonzero) digits is 1, while the sum is 5.
The spelling of 1100001000011 in words is "one trillion, one hundred billion, one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •