Base | Representation |
---|---|
bin | 1101000010010… |
… | …00010011111100 |
3 | 21121202110101100 |
4 | 12201020103330 |
5 | 210443114332 |
6 | 14503413100 |
7 | 2465305050 |
oct | 641102374 |
9 | 247673340 |
10 | 109348092 |
11 | 567a6927 |
12 | 30754190 |
13 | 19867719 |
14 | 10745c60 |
15 | 98ee67c |
hex | 68484fc |
109348092 has 72 divisors (see below), whose sum is σ = 316979936. Its totient is φ = 31135104.
The previous prime is 109348091. The next prime is 109348117. The reversal of 109348092 is 290843901.
109348092 is a `hidden beast` number, since 1 + 0 + 93 + 480 + 92 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109348091) 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, 99498 + ... + 100590.
Almost surely, 2109348092 is an apocalyptic number.
109348092 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 109348092, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158489968).
109348092 is an abundant number, since it is smaller than the sum of its proper divisors (207631844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109348092 is a wasteful number, since it uses less digits than its factorization.
109348092 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1507 (or 1502 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 109348092 is about 10456.9638040877. The cubic root of 109348092 is about 478.1935748368.
The spelling of 109348092 in words is "one hundred nine million, three hundred forty-eight thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •