Base | Representation |
---|---|
bin | 1101001000001… |
… | …0110111110000 |
3 | 10211121102212100 |
4 | 3102002313300 |
5 | 103043441000 |
6 | 5244100400 |
7 | 1236006420 |
oct | 322026760 |
9 | 124542770 |
10 | 55062000 |
11 | 29098994 |
12 | 16534700 |
13 | b53b486 |
14 | 7454480 |
15 | 4c79a00 |
hex | 3482df0 |
55062000 has 480 divisors, whose sum is σ = 241413120. Its totient is φ = 11404800.
The previous prime is 55061987. The next prime is 55062001. The reversal of 55062000 is 26055.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55062001) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2393989 + ... + 2394011.
It is an arithmetic number, because the mean of its divisors is an integer number (502944).
Almost surely, 255062000 is an apocalyptic number.
55062000 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 55062000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120706560).
55062000 is an abundant number, since it is smaller than the sum of its proper divisors (186351120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55062000 is a wasteful number, since it uses less digits than its factorization.
55062000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78 (or 59 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 18.
The square root of 55062000 is about 7420.3773488954. The cubic root of 55062000 is about 380.4380912342.
Adding to 55062000 its reverse (26055), we get a palindrome (55088055).
The spelling of 55062000 in words is "fifty-five million, sixty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •