Base | Representation |
---|---|
bin | 110011010001100010… |
… | …1000111011111010001 |
3 | 101112012202210020001222 |
4 | 1212203011013133101 |
5 | 3301001203210001 |
6 | 122330043534425 |
7 | 10645430225261 |
oct | 1464305073721 |
9 | 345182706058 |
10 | 110110210001 |
11 | 42774385560 |
12 | 1940b82a415 |
13 | a4ca2a6a1c |
14 | 5487ab17a1 |
15 | 2ce6b1761b |
hex | 19a31477d1 |
110110210001 has 8 divisors (see below), whose sum is σ = 120397648224. Its totient is φ = 99869008320.
The previous prime is 110110209899. The next prime is 110110210003. The reversal of 110110210001 is 100012011011.
It is a happy number.
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 110110210001 - 226 = 110043101137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110110210003) 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 7 ways as a sum of consecutive naturals, for example, 11554151 + ... + 11563676.
It is an arithmetic number, because the mean of its divisors is an integer number (15049706028).
Almost surely, 2110110210001 is an apocalyptic number.
110110210001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110110210001 is a deficient number, since it is larger than the sum of its proper divisors (10287438223).
110110210001 is a wasteful number, since it uses less digits than its factorization.
110110210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23118271.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 110110210001 its reverse (100012011011), we get a palindrome (210122221012).
The spelling of 110110210001 in words is "one hundred ten billion, one hundred ten million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •