Base | Representation |
---|---|
bin | 110010110011011100… |
… | …011100100010101000 |
3 | 12012210200210120120220 |
4 | 302303130130202220 |
5 | 1343204321424102 |
6 | 41020543450040 |
7 | 3640542634410 |
oct | 626334344250 |
9 | 165720716526 |
10 | 54550186152 |
11 | 21153181280 |
12 | a6a48b6920 |
13 | 51b4668577 |
14 | 28d6b81640 |
15 | 16440981bc |
hex | cb371c8a8 |
54550186152 has 256 divisors, whose sum is σ = 179859640320. Its totient is φ = 13366425600.
The previous prime is 54550186133. The next prime is 54550186157. The reversal of 54550186152 is 25168105545.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (54550186157) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 3094002 + ... + 3111582.
It is an arithmetic number, because the mean of its divisors is an integer number (702576720).
Almost surely, 254550186152 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 54550186152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89929820160).
54550186152 is an abundant number, since it is smaller than the sum of its proper divisors (125309454168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54550186152 is a wasteful number, since it uses less digits than its factorization.
54550186152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17704 (or 17700 counting only the distinct ones).
The product of its (nonzero) digits is 240000, while the sum is 42.
The spelling of 54550186152 in words is "fifty-four billion, five hundred fifty million, one hundred eighty-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •