Base | Representation |
---|---|
bin | 1101001011110… |
… | …1000010010101 |
3 | 10212001112200020 |
4 | 3102331002111 |
5 | 103124101440 |
6 | 5253135353 |
7 | 1241021130 |
oct | 322750225 |
9 | 125045606 |
10 | 55300245 |
11 | 29240990 |
12 | 1662a559 |
13 | b5c2a50 |
14 | 74b7217 |
15 | 4cc53d0 |
hex | 34bd095 |
55300245 has 128 divisors (see below), whose sum is σ = 123863040. Its totient is φ = 20321280.
The previous prime is 55300243. The next prime is 55300261. The reversal of 55300245 is 54200355.
55300245 = 282 + 292 + ... + 5492.
55300245 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 55300245 - 21 = 55300243 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55300243) 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 127 ways as a sum of consecutive naturals, for example, 435372 + ... + 435498.
It is an arithmetic number, because the mean of its divisors is an integer number (967680).
Almost surely, 255300245 is an apocalyptic number.
55300245 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
55300245 is an abundant number, since it is smaller than the sum of its proper divisors (68562795).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55300245 is a wasteful number, since it uses less digits than its factorization.
55300245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195.
The product of its (nonzero) digits is 3000, while the sum is 24.
The square root of 55300245 is about 7436.4134500443. The cubic root of 55300245 is about 380.9860012354.
The spelling of 55300245 in words is "fifty-five million, three hundred thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •