Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …000111111101110111001 |
3 | 10220011022122210011222121 |
4 | 100000131300333232321 |
5 | 121010310304323001 |
6 | 2201201005321241 |
7 | 142321204214410 |
oct | 20003560775671 |
9 | 3804278704877 |
10 | 1100011011001 |
11 | 39456a5a17a1 |
12 | 159233566221 |
13 | 7c966162066 |
14 | 3b352b32477 |
15 | 1d9319286a1 |
hex | 1001dc3fbb9 |
1100011011001 has 8 divisors (see below), whose sum is σ = 1274861856384. Its totient is φ = 929586769440.
The previous prime is 1100011010947. The next prime is 1100011011041. The reversal of 1100011011001 is 1001101100011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100011011001 - 27 = 1100011010873 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1100011011041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1106650420 + ... + 1106651413.
It is an arithmetic number, because the mean of its divisors is an integer number (159357732048).
Almost surely, 21100011011001 is an apocalyptic number.
It is an amenable number.
1100011011001 is a deficient number, since it is larger than the sum of its proper divisors (174850845383).
1100011011001 is an equidigital number, since it uses as much as digits as its factorization.
1100011011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2213301911.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1100011011001 its reverse (1001101100011), we get a palindrome (2101112111012).
The spelling of 1100011011001 in words is "one trillion, one hundred billion, eleven million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •