Base | Representation |
---|---|
bin | 100001000011101… |
… | …1011010110000000 |
3 | 2212022020101200212 |
4 | 1002013123112000 |
5 | 4232431241024 |
6 | 302022533252 |
7 | 36326261243 |
oct | 10207332600 |
9 | 2768211625 |
10 | 1109243264 |
11 | 51a158978 |
12 | 26b597228 |
13 | 148a68c7c |
14 | a746725a |
15 | 675aea0e |
hex | 421db580 |
1109243264 has 64 divisors (see below), whose sum is σ = 2313433440. Its totient is φ = 528777216.
The previous prime is 1109243227. The next prime is 1109243297. The reversal of 1109243264 is 4623429011.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 1109243264.
It is a congruent number.
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, 1698362 + ... + 1699014.
Almost surely, 21109243264 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1109243264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1156716720).
1109243264 is an abundant number, since it is smaller than the sum of its proper divisors (1204190176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1109243264 is an equidigital number, since it uses as much as digits as its factorization.
1109243264 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1267 (or 1255 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 1109243264 is about 33305.3038418808. The cubic root of 1109243264 is about 1035.1634596009.
The spelling of 1109243264 in words is "one billion, one hundred nine million, two hundred forty-three thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •