Base | Representation |
---|---|
bin | 1101010100100… |
… | …1010101010000 |
3 | 10220010201221121 |
4 | 3111021111100 |
5 | 103300444041 |
6 | 5313332024 |
7 | 1245633400 |
oct | 325112520 |
9 | 126121847 |
10 | 55874896 |
11 | 295a3700 |
12 | 16867014 |
13 | b76448c |
14 | 75c6800 |
15 | 4d8a7d1 |
hex | 3549550 |
55874896 has 180 divisors, whose sum is σ = 150407040. Its totient is φ = 19958400.
The previous prime is 55874891. The next prime is 55874899. The reversal of 55874896 is 69847855.
Its product of digits (2419200) is a multiple of the sum of its prime divisors (70).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55874891) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1802401 + ... + 1802431.
Almost surely, 255874896 is an apocalyptic number.
55874896 is a gapful number since it is divisible by the number (56) 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 55874896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75203520).
55874896 is an abundant number, since it is smaller than the sum of its proper divisors (94532144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55874896 is a wasteful number, since it uses less digits than its factorization.
55874896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94 (or 70 counting only the distinct ones).
The product of its digits is 2419200, while the sum is 52.
The square root of 55874896 is about 7474.9512372991. The cubic root of 55874896 is about 382.3011249183.
The spelling of 55874896 in words is "fifty-five million, eight hundred seventy-four thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •