Base | Representation |
---|---|
bin | 1101001110101… |
… | …0011010101101 |
3 | 10212101222122200 |
4 | 3103222122231 |
5 | 103201024000 |
6 | 5301132113 |
7 | 1242424062 |
oct | 323523255 |
9 | 125358580 |
10 | 55486125 |
11 | 29358602 |
12 | 166ba039 |
13 | b659536 |
14 | 7524c69 |
15 | 4d10500 |
hex | 34ea6ad |
55486125 has 96 divisors (see below), whose sum is σ = 108506112. Its totient is φ = 27216000.
The previous prime is 55486121. The next prime is 55486127. The reversal of 55486125 is 52168455.
55486125 is a `hidden beast` number, since 55 + 486 + 125 = 666.
It is not a de Polignac number, because 55486125 - 22 = 55486121 is a prime.
It is a taxicab number since it can be written as a sum of two cubes in more than one way. Here 55486125 = 853 + 3803 = 1903 + 3653.
It is a self number, because there is not a number n which added to its sum of digits gives 55486125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55486121) 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, 1290354 + ... + 1290396.
It is an arithmetic number, because the mean of its divisors is an integer number (1130272).
Almost surely, 255486125 is an apocalyptic number.
It is an amenable number.
55486125 is a deficient number, since it is larger than the sum of its proper divisors (53019987).
55486125 is a wasteful number, since it uses less digits than its factorization.
55486125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132 (or 119 counting only the distinct ones).
The product of its digits is 48000, while the sum is 36.
The square root of 55486125 is about 7448.9009256400. The cubic root of 55486125 is about 381.4123916283.
It can be divided in two parts, 55486 and 125, that added together give a triangular number (55611 = T333).
The spelling of 55486125 in words is "fifty-five million, four hundred eighty-six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •