Base | Representation |
---|---|
bin | 1101000000011… |
… | …10011010000000 |
3 | 21121022102000220 |
4 | 12200032122000 |
5 | 210413022122 |
6 | 14454343040 |
7 | 2463266421 |
oct | 640163200 |
9 | 247272026 |
10 | 109110912 |
11 | 56654709 |
12 | 3065aa80 |
13 | 197b3791 |
14 | 106c3648 |
15 | 98a425c |
hex | 680e680 |
109110912 has 64 divisors (see below), whose sum is σ = 291924000. Its totient is φ = 36107264.
The previous prime is 109110899. The next prime is 109110959. The reversal of 109110912 is 219011901.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×1091109122 = 23810382234943488, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56263 + ... + 58169.
Almost surely, 2109110912 is an apocalyptic number.
109110912 is a gapful number since it is divisible by the number (12) 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 109110912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145962000).
109110912 is an abundant number, since it is smaller than the sum of its proper divisors (182813088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109110912 is a wasteful number, since it uses less digits than its factorization.
109110912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2073 (or 2061 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 24.
The square root of 109110912 is about 10445.6168798209. The cubic root of 109110912 is about 477.8475847924.
The spelling of 109110912 in words is "one hundred nine million, one hundred ten thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •