Base | Representation |
---|---|
bin | 1101001001011… |
… | …1100000011000 |
3 | 10211202201210201 |
4 | 3102113200120 |
5 | 103104142040 |
6 | 5245551544 |
7 | 1236511012 |
oct | 322274030 |
9 | 124681721 |
10 | 55146520 |
11 | 29146440 |
12 | 165755b4 |
13 | b56aaa0 |
14 | 74771b2 |
15 | 4c94a9a |
hex | 3497818 |
55146520 has 128 divisors (see below), whose sum is σ = 150958080. Its totient is φ = 17856000.
The previous prime is 55146491. The next prime is 55146523. The reversal of 55146520 is 2564155.
It is a super-2 number, since 2×551465202 = 6082277336220800, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55146523) 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 31 ways as a sum of consecutive naturals, for example, 177165 + ... + 177475.
It is an arithmetic number, because the mean of its divisors is an integer number (1179360).
Almost surely, 255146520 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 55146520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75479040).
55146520 is an abundant number, since it is smaller than the sum of its proper divisors (95811560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55146520 is a wasteful number, since it uses less digits than its factorization.
55146520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377 (or 373 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 55146520 is about 7426.0702932305. The cubic root of 55146520 is about 380.6326488182.
The spelling of 55146520 in words is "fifty-five million, one hundred forty-six thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •