Base | Representation |
---|---|
bin | 100001000100101… |
… | …0101001001110000 |
3 | 2212100011202002200 |
4 | 1002021111021300 |
5 | 4233043222232 |
6 | 302041343200 |
7 | 36333436656 |
oct | 10211251160 |
9 | 2770152080 |
10 | 1109742192 |
11 | 51a469809 |
12 | 26b797b00 |
13 | 148bb20b0 |
14 | a7556dd6 |
15 | 6765c77c |
hex | 42255270 |
1109742192 has 120 divisors (see below), whose sum is σ = 3416073024. Its totient is φ = 334167552.
The previous prime is 1109742169. The next prime is 1109742211. The reversal of 1109742192 is 2912479011.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 81678 + ... + 94290.
Almost surely, 21109742192 is an apocalyptic number.
1109742192 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 1109742192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1708036512).
1109742192 is an abundant number, since it is smaller than the sum of its proper divisors (2306330832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1109742192 is a wasteful number, since it uses less digits than its factorization.
1109742192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12687 (or 12678 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 36.
The square root of 1109742192 is about 33312.7932182217. The cubic root of 1109742192 is about 1035.3186388526.
The spelling of 1109742192 in words is "one billion, one hundred nine million, seven hundred forty-two thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •