Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …011000001110100110001 |
3 | 10220011120120020221020221 |
4 | 100000203223001310301 |
5 | 121011011142010001 |
6 | 2201214505333041 |
7 | 142323516434650 |
oct | 20004353016461 |
9 | 3804516227227 |
10 | 1100110110001 |
11 | 3946105282a1 |
12 | 159260797181 |
13 | 7c98084b716 |
14 | 3b361d6b197 |
15 | 1d93a4a11a1 |
hex | 10023ac1d31 |
1100110110001 has 8 divisors (see below), whose sum is σ = 1257760414400. Its totient is φ = 942582734928.
The previous prime is 1100110109971. The next prime is 1100110110031. The reversal of 1100110110001 is 1000110110011.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1100110109971) and next prime (1100110110031).
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 1100110110001 - 29 = 1100110109489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (1100110110031) 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, 30713151 + ... + 30748948.
It is an arithmetic number, because the mean of its divisors is an integer number (157220051800).
Almost surely, 21100110110001 is an apocalyptic number.
It is an amenable number.
1100110110001 is a deficient number, since it is larger than the sum of its proper divisors (157650304399).
1100110110001 is an equidigital number, since it uses as much as digits as its factorization.
1100110110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61464663.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1100110110001 its reverse (1000110110011), we get a palindrome (2100220220012).
The spelling of 1100110110001 in words is "one trillion, one hundred billion, one hundred ten million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •