Base | Representation |
---|---|
bin | 1010100010001100100100… |
… | …1100111100000110011000 |
3 | 1112000021201211100020222222 |
4 | 2220203021030330012120 |
5 | 3004232140001123303 |
6 | 40344550523003212 |
7 | 2303546544553166 |
oct | 250431114740630 |
9 | 45007654306888 |
10 | 11582607442328 |
11 | 3766179a414aa |
12 | 1370953969508 |
13 | 660309954200 |
14 | 2c085b952236 |
15 | 15145465b938 |
hex | a88c933c198 |
11582607442328 has 96 divisors (see below), whose sum is σ = 24330620430000. Its totient is φ = 5160791720448.
The previous prime is 11582607442283. The next prime is 11582607442369. The reversal of 11582607442328 is 82324470628511.
It is a happy number.
It is a Cunningham number, because it is equal to 34033232-1.
It is a self number, because there is not a number n which added to its sum of digits gives 11582607442328.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 394770683 + ... + 394800021.
Almost surely, 211582607442328 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 11582607442328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12165310215000).
11582607442328 is an abundant number, since it is smaller than the sum of its proper divisors (12748012987672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11582607442328 is a wasteful number, since it uses less digits than its factorization.
11582607442328 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39469 (or 39452 counting only the distinct ones).
The product of its (nonzero) digits is 5160960, while the sum is 53.
The spelling of 11582607442328 in words is "eleven trillion, five hundred eighty-two billion, six hundred seven million, four hundred forty-two thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •