Base | Representation |
---|---|
bin | 1101000111101… |
… | …10001010110000 |
3 | 21200002122020000 |
4 | 12203312022300 |
5 | 211133411313 |
6 | 14530550000 |
7 | 2504332146 |
oct | 643661260 |
9 | 250078200 |
10 | 110060208 |
11 | 57142955 |
12 | 30a38300 |
13 | 19a568ab |
14 | 1088d596 |
15 | 99e0673 |
hex | 68f62b0 |
110060208 has 100 divisors (see below), whose sum is σ = 321115608. Its totient is φ = 36391680.
The previous prime is 110060161. The next prime is 110060213. The reversal of 110060208 is 802060011.
It is a super-2 number, since 2×1100602082 = 24226498770006528, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 210988 + ... + 211508.
Almost surely, 2110060208 is an apocalyptic number.
110060208 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110060208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160557804).
110060208 is an abundant number, since it is smaller than the sum of its proper divisors (211055400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110060208 is a wasteful number, since it uses less digits than its factorization.
110060208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704 (or 689 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 110060208 is about 10490.9583928257. The cubic root of 110060208 is about 479.2293884910.
The spelling of 110060208 in words is "one hundred ten million, sixty thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •