Base | Representation |
---|---|
bin | 100001000011010… |
… | …0101110100100000 |
3 | 2212021211020222011 |
4 | 1002012211310200 |
5 | 4232402232112 |
6 | 302014122304 |
7 | 36324356134 |
oct | 10206456440 |
9 | 2767736864 |
10 | 1109024032 |
11 | 51a019196 |
12 | 26b4b0394 |
13 | 1489c024c |
14 | a740b3c4 |
15 | 67569aa7 |
hex | 421a5d20 |
1109024032 has 72 divisors (see below), whose sum is σ = 2312025660. Its totient is φ = 523031040.
The previous prime is 1109024029. The next prime is 1109024057. The reversal of 1109024032 is 2304209011.
It can be written as a sum of positive squares in 2 ways, for example, as 1107292176 + 1731856 = 33276^2 + 1316^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1109023994 and 1109024012.
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 11 ways as a sum of consecutive naturals, for example, 2049682 + ... + 2050222.
Almost surely, 21109024032 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 1109024032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1156012830).
1109024032 is an abundant number, since it is smaller than the sum of its proper divisors (1203001628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1109024032 is an equidigital number, since it uses as much as digits as its factorization.
1109024032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674 (or 619 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 1109024032 is about 33302.0124316835. The cubic root of 1109024032 is about 1035.0952581776.
The spelling of 1109024032 in words is "one billion, one hundred nine million, twenty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •