Base | Representation |
---|---|
bin | 110011101001110110… |
… | …100111100010000000 |
3 | 12022011022110011112010 |
4 | 303221312213202000 |
5 | 1402042013012301 |
6 | 41251312532520 |
7 | 4002265601532 |
oct | 635166474200 |
9 | 168138404463 |
10 | 55463016576 |
11 | 21581477290 |
12 | a8ba551140 |
13 | 52cb804c06 |
14 | 29820bb852 |
15 | 16992ab5d6 |
hex | ce9da7880 |
55463016576 has 128 divisors (see below), whose sum is σ = 165060855360. Its totient is φ = 16352686080.
The previous prime is 55463016551. The next prime is 55463016589. The reversal of 55463016576 is 67561036455.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×554630165762 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
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 15 ways as a sum of consecutive naturals, for example, 21151 + ... + 333726.
Almost surely, 255463016576 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 55463016576, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82530427680).
55463016576 is an abundant number, since it is smaller than the sum of its proper divisors (109597838784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55463016576 is a wasteful number, since it uses less digits than its factorization.
55463016576 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354942 (or 354930 counting only the distinct ones).
The product of its (nonzero) digits is 2268000, while the sum is 48.
The spelling of 55463016576 in words is "fifty-five billion, four hundred sixty-three million, sixteen thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.031 sec. • engine limits •