Base | Representation |
---|---|
bin | 1100111111101… |
… | …00001110110100 |
3 | 21121002221222002 |
4 | 12133310032310 |
5 | 210401104300 |
6 | 14452154432 |
7 | 2462342021 |
oct | 637641664 |
9 | 247087862 |
10 | 109003700 |
11 | 56591103 |
12 | 30608a18 |
13 | 19776a40 |
14 | 10696548 |
15 | 98825d5 |
hex | 67f43b4 |
109003700 has 72 divisors (see below), whose sum is σ = 256650240. Its totient is φ = 39945600.
The previous prime is 109003681. The next prime is 109003709. The reversal of 109003700 is 7300901.
It is a super-2 number, since 2×1090037002 = 23763613227380000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109003709) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 248081 + ... + 248519.
Almost surely, 2109003700 is an apocalyptic number.
109003700 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 109003700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128325120).
109003700 is an abundant number, since it is smaller than the sum of its proper divisors (147646540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109003700 is a wasteful number, since it uses less digits than its factorization.
109003700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 657 (or 650 counting only the distinct ones).
The product of its (nonzero) digits is 189, while the sum is 20.
The square root of 109003700 is about 10440.4837052696. The cubic root of 109003700 is about 477.6910230478.
The spelling of 109003700 in words is "one hundred nine million, three thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •