Base | Representation |
---|---|
bin | 10000001000001101100… |
… | …000110100010000101000 |
3 | 10220221210022011122211020 |
4 | 100020031200310100220 |
5 | 121124324014100330 |
6 | 2205054201132440 |
7 | 143034256562502 |
oct | 20101540642050 |
9 | 3827708148736 |
10 | 1108328268840 |
11 | 398048460701 |
12 | 15a974a8a120 |
13 | 806903361c0 |
14 | 3b9015c2d72 |
15 | 1dc6bbe1210 |
hex | 1020d834428 |
1108328268840 has 256 divisors, whose sum is σ = 3826828696320. Its totient is φ = 254370693120.
The previous prime is 1108328268821. The next prime is 1108328268911. The reversal of 1108328268840 is 488628238011.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2642350 + ... + 3032930.
It is an arithmetic number, because the mean of its divisors is an integer number (14948549595).
Almost surely, 21108328268840 is an apocalyptic number.
1108328268840 is a gapful number since it is divisible by the number (10) 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 1108328268840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1913414348160).
1108328268840 is an abundant number, since it is smaller than the sum of its proper divisors (2718500427480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1108328268840 is a wasteful number, since it uses less digits than its factorization.
1108328268840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 390732 (or 390728 counting only the distinct ones).
The product of its (nonzero) digits is 1179648, while the sum is 51.
The spelling of 1108328268840 in words is "one trillion, one hundred eight billion, three hundred twenty-eight million, two hundred sixty-eight thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •