Base | Representation |
---|---|
bin | 1101000111110… |
… | …0000101110001 |
3 | 10211120000202122 |
4 | 3101330011301 |
5 | 103042043400 |
6 | 5243324025 |
7 | 1235532431 |
oct | 321740561 |
9 | 124500678 |
10 | 55034225 |
11 | 2907a034 |
12 | 16520615 |
13 | b52b93c |
14 | 74482c1 |
15 | 4c71685 |
hex | 347c171 |
55034225 has 12 divisors (see below), whose sum is σ = 68405964. Its totient is φ = 43921920.
The previous prime is 55034201. The next prime is 55034233. The reversal of 55034225 is 52243055.
55034225 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 1700416 + 53333809 = 1304^2 + 7303^2 .
It is a de Polignac number, because none of the positive numbers 2k-55034225 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55034194 and 55034203.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 9017 + ... + 13833.
It is an arithmetic number, because the mean of its divisors is an integer number (5700497).
Almost surely, 255034225 is an apocalyptic number.
It is an amenable number.
55034225 is a deficient number, since it is larger than the sum of its proper divisors (13371739).
55034225 is a wasteful number, since it uses less digits than its factorization.
55034225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5284 (or 5279 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 26.
The square root of 55034225 is about 7418.5055772709. The cubic root of 55034225 is about 380.3741121730.
The spelling of 55034225 in words is "fifty-five million, thirty-four thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •