Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …001100000010001001011 |
3 | 10220020212122121211121020 |
4 | 100001120301200101023 |
5 | 121014322224000021 |
6 | 2201443132243523 |
7 | 142354555041633 |
oct | 20013061402113 |
9 | 3806778554536 |
10 | 1101001000011 |
11 | 394a283a8130 |
12 | 15946b0105a3 |
13 | 7ca932a5683 |
14 | 3b4083d56c3 |
15 | 1d98d7cd7c6 |
hex | 10058c6044b |
1101001000011 has 32 divisors (see below), whose sum is σ = 1612280011776. Its totient is φ = 662766624000.
The previous prime is 1101000999997. The next prime is 1101001000013. The reversal of 1101001000011 is 1100001001011.
It is not a de Polignac number, because 1101001000011 - 210 = 1101000998987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1101001000013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13798671 + ... + 13878231.
It is an arithmetic number, because the mean of its divisors is an integer number (50383750368).
Almost surely, 21101001000011 is an apocalyptic number.
1101001000011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1101001000011 is a deficient number, since it is larger than the sum of its proper divisors (511279011765).
1101001000011 is a wasteful number, since it uses less digits than its factorization.
1101001000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82403.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1101001000011 its reverse (1100001001011), we get a palindrome (2201002001022).
It can be divided in two parts, 110100 and 1000011, that added together give a palindrome (1110111).
The spelling of 1101001000011 in words is "one trillion, one hundred one billion, one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •