Base | Representation |
---|---|
bin | 1101010101101… |
… | …0011111110000 |
3 | 10220021022101110 |
4 | 3111122133300 |
5 | 103310221300 |
6 | 5315033320 |
7 | 1246345353 |
oct | 325323760 |
9 | 126238343 |
10 | 55945200 |
11 | 29641503 |
12 | 1689b840 |
13 | b78a48c |
14 | 760429a |
15 | 4da1550 |
hex | 355a7f0 |
55945200 has 120 divisors (see below), whose sum is σ = 187095168. Its totient is φ = 14263040.
The previous prime is 55945189. The next prime is 55945207. The reversal of 55945200 is 254955.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55945207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26587 + ... + 28613.
Almost surely, 255945200 is an apocalyptic number.
55945200 is a gapful number since it is divisible by the number (50) 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 55945200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (93547584).
55945200 is an abundant number, since it is smaller than the sum of its proper divisors (131149968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55945200 is a wasteful number, since it uses less digits than its factorization.
55945200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2071 (or 2060 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
The square root of 55945200 is about 7479.6523983404. The cubic root of 55945200 is about 382.4613998384.
The spelling of 55945200 in words is "fifty-five million, nine hundred forty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •