Base | Representation |
---|---|
bin | 110011111011100001… |
… | …100111111011100000 |
3 | 12022220222100020112110 |
4 | 303323201213323200 |
5 | 1403143413044242 |
6 | 41340543355320 |
7 | 4012525645620 |
oct | 637341477340 |
9 | 168828306473 |
10 | 55759503072 |
11 | 21713870a49 |
12 | a9818b2b40 |
13 | 5348072700 |
14 | 29ad618880 |
15 | 16b532439c |
hex | cfb867ee0 |
55759503072 has 288 divisors, whose sum is σ = 190676747520. Its totient is φ = 13931274240.
The previous prime is 55759503071. The next prime is 55759503077. The reversal of 55759503072 is 27030595755.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55759503071) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2144872 + ... + 2170712.
It is an arithmetic number, because the mean of its divisors is an integer number (662072040).
Almost surely, 255759503072 is an apocalyptic number.
55759503072 is a gapful number since it is divisible by the number (52) 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 55759503072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95338373760).
55759503072 is an abundant number, since it is smaller than the sum of its proper divisors (134917244448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55759503072 is a wasteful number, since it uses less digits than its factorization.
55759503072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25906 (or 25885 counting only the distinct ones).
The product of its (nonzero) digits is 1653750, while the sum is 48.
The spelling of 55759503072 in words is "fifty-five billion, seven hundred fifty-nine million, five hundred three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •