Base | Representation |
---|---|
bin | 1101010000000… |
… | …0000101001000 |
3 | 10212120111101000 |
4 | 3110000011020 |
5 | 103211343411 |
6 | 5303055000 |
7 | 1243243551 |
oct | 324000510 |
9 | 125514330 |
10 | 55574856 |
11 | 29409237 |
12 | 16741460 |
13 | b68aa3c |
14 | 7549328 |
15 | 4d2b956 |
hex | 3500148 |
55574856 has 64 divisors (see below), whose sum is σ = 154987200. Its totient is φ = 18451584.
The previous prime is 55574833. The next prime is 55574863. The reversal of 55574856 is 65847555.
55574856 is a `hidden beast` number, since 5 + 557 + 48 + 56 = 666.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 98431 + ... + 98993.
It is an arithmetic number, because the mean of its divisors is an integer number (2421675).
Almost surely, 255574856 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 55574856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77493600).
55574856 is an abundant number, since it is smaller than the sum of its proper divisors (99412344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55574856 is a wasteful number, since it uses less digits than its factorization.
55574856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1035 (or 1025 counting only the distinct ones).
The product of its digits is 840000, while the sum is 45.
The square root of 55574856 is about 7454.8545257436. The cubic root of 55574856 is about 381.6155960557.
The spelling of 55574856 in words is "fifty-five million, five hundred seventy-four thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •