Base | Representation |
---|---|
bin | 100001000000001… |
… | …1100100101010000 |
3 | 2212011210102111110 |
4 | 1002000130211100 |
5 | 4231444211303 |
6 | 301515413320 |
7 | 36304600200 |
oct | 10200344520 |
9 | 2764712443 |
10 | 1107413328 |
11 | 51911902a |
12 | 26aa54240 |
13 | 148578078 |
14 | a710c400 |
15 | 6734c703 |
hex | 4201c950 |
1107413328 has 120 divisors (see below), whose sum is σ = 3503183520. Its totient is φ = 299738880.
The previous prime is 1107413327. The next prime is 1107413339. The reversal of 1107413328 is 8233147011.
It is a junction number, because it is equal to n+sod(n) for n = 1107413295 and 1107413304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1107413327) 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, 32298 + ... + 57078.
It is an arithmetic number, because the mean of its divisors is an integer number (29193196).
Almost surely, 21107413328 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 1107413328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1751591760).
1107413328 is an abundant number, since it is smaller than the sum of its proper divisors (2395770192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1107413328 is a wasteful number, since it uses less digits than its factorization.
1107413328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24825 (or 24812 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 1107413328 is about 33277.8203613157. The cubic root of 1107413328 is about 1034.5939044895.
The spelling of 1107413328 in words is "one billion, one hundred seven million, four hundred thirteen thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •