Base | Representation |
---|---|
bin | 110011010111100001… |
… | …010011000000000000 |
3 | 12021100212200112110000 |
4 | 303113201103000000 |
5 | 1400424243000233 |
6 | 41201004240000 |
7 | 3661542324660 |
oct | 632741230000 |
9 | 167325615400 |
10 | 55155437568 |
11 | 21433896660 |
12 | a833540000 |
13 | 527cb824ba |
14 | 29532d41a0 |
15 | 167c2a1d13 |
hex | cd7853000 |
55155437568 has 1040 divisors, whose sum is σ = 219217895424. Its totient is φ = 13377208320.
The previous prime is 55155437567. The next prime is 55155437593. The reversal of 55155437568 is 86573455155.
55155437568 is a `hidden beast` number, since 5 + 5 + 1 + 554 + 37 + 56 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (55155437567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 434294721 + ... + 434294847.
Almost surely, 255155437568 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 55155437568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (109608947712).
55155437568 is an abundant number, since it is smaller than the sum of its proper divisors (164062457856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55155437568 is a wasteful number, since it uses less digits than its factorization.
55155437568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198 (or 167 counting only the distinct ones).
The product of its digits is 12600000, while the sum is 54.
The spelling of 55155437568 in words is "fifty-five billion, one hundred fifty-five million, four hundred thirty-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •