Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0111011101001000001 |
3 | 101112012001221122221020 |
4 | 1212202132323221001 |
5 | 3300441122400001 |
6 | 122325045220053 |
7 | 10645246154511 |
oct | 1464236735101 |
9 | 345161848836 |
10 | 110100200001 |
11 | 42769768930 |
12 | 19408401629 |
13 | a4c81b074c |
14 | 5486627841 |
15 | 2ce5cdb736 |
hex | 19a27bba41 |
110100200001 has 32 divisors (see below), whose sum is σ = 169599909888. Its totient is φ = 62789725440.
The previous prime is 110100199999. The next prime is 110100200003. The reversal of 110100200001 is 100002001011.
It is an interprime number because it is at equal distance from previous prime (110100199999) and next prime (110100200003).
It is not a de Polignac number, because 110100200001 - 21 = 110100199999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110100200003) 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 31 ways as a sum of consecutive naturals, for example, 3294960 + ... + 3328206.
It is an arithmetic number, because the mean of its divisors is an integer number (5299997184).
Almost surely, 2110100200001 is an apocalyptic number.
110100200001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110100200001 is a deficient number, since it is larger than the sum of its proper divisors (59499709887).
110100200001 is a wasteful number, since it uses less digits than its factorization.
110100200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39181.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 110100200001 its reverse (100002001011), we get a palindrome (210102201012).
The spelling of 110100200001 in words is "one hundred ten billion, one hundred million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •