Base | Representation |
---|---|
bin | 11001000001000010011011… |
… | …01011110010000000110000 |
3 | 21012210000122012200121221020 |
4 | 30200201031223302000300 |
5 | 24202301012034343330 |
6 | 312555452233255440 |
7 | 14405300630424000 |
oct | 1440411553620060 |
9 | 235700565617836 |
10 | 55011244449840 |
11 | 1658a1573961a8 |
12 | 620566a564580 |
13 | 24906cc25cc53 |
14 | d827b64d4000 |
15 | 655e7e60a210 |
hex | 32084daf2030 |
55011244449840 has 640 divisors, whose sum is σ = 201197122560000. Its totient is φ = 12427957914624.
The previous prime is 55011244449829. The next prime is 55011244449857. The reversal of 55011244449840 is 4894444211055.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2597432371 + ... + 2597453549.
It is an arithmetic number, because the mean of its divisors is an integer number (314370504000).
Almost surely, 255011244449840 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 55011244449840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100598561280000).
55011244449840 is an abundant number, since it is smaller than the sum of its proper divisors (146185878110160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55011244449840 is a wasteful number, since it uses less digits than its factorization.
55011244449840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21582 (or 21562 counting only the distinct ones).
The product of its (nonzero) digits is 3686400, while the sum is 51.
The spelling of 55011244449840 in words is "fifty-five trillion, eleven billion, two hundred forty-four million, four hundred forty-nine thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •