Base | Representation |
---|---|
bin | 1101000110100… |
… | …01111111000000 |
3 | 21122211002220211 |
4 | 12203101333000 |
5 | 211114141000 |
6 | 14523443504 |
7 | 2503144102 |
oct | 643217700 |
9 | 248732824 |
10 | 109912000 |
11 | 57051570 |
12 | 30986594 |
13 | 19a042b3 |
14 | 10851572 |
15 | 99b17ba |
hex | 68d1fc0 |
109912000 has 112 divisors (see below), whose sum is σ = 297180000. Its totient is φ = 39936000.
The previous prime is 109911947. The next prime is 109912007. The reversal of 109912000 is 219901.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109912007) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 87376 + ... + 88624.
Almost surely, 2109912000 is an apocalyptic number.
109912000 is a gapful number since it is divisible by the number (10) 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 109912000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148590000).
109912000 is an abundant number, since it is smaller than the sum of its proper divisors (187268000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109912000 is a wasteful number, since it uses less digits than its factorization.
109912000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1287 (or 1267 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 22.
The square root of 109912000 is about 10483.8924069260. The cubic root of 109912000 is about 479.0141804226.
The spelling of 109912000 in words is "one hundred nine million, nine hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •