Base | Representation |
---|---|
bin | 1101001000010… |
… | …1100111101100 |
3 | 10211122000022101 |
4 | 3102011213230 |
5 | 103044321020 |
6 | 5244224444 |
7 | 1236054304 |
oct | 322054754 |
9 | 124560271 |
10 | 55073260 |
11 | 290a63a0 |
12 | 1653b124 |
13 | b543638 |
14 | 7458604 |
15 | 4c7d00a |
hex | 34859ec |
55073260 has 48 divisors (see below), whose sum is σ = 127008000. Its totient is φ = 19893440.
The previous prime is 55073257. The next prime is 55073261. The reversal of 55073260 is 6237055.
55073260 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (55073261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35991 + ... + 37489.
It is an arithmetic number, because the mean of its divisors is an integer number (2646000).
Almost surely, 255073260 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 55073260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63504000).
55073260 is an abundant number, since it is smaller than the sum of its proper divisors (71934740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55073260 is a wasteful number, since it uses less digits than its factorization.
55073260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1686 (or 1684 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 28.
The square root of 55073260 is about 7421.1360316329. The cubic root of 55073260 is about 380.4640222509.
The spelling of 55073260 in words is "fifty-five million, seventy-three thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •