Base | Representation |
---|---|
bin | 1101001011010… |
… | …1000001110101 |
3 | 10211222212200102 |
4 | 3102311001311 |
5 | 103122024240 |
6 | 5252323445 |
7 | 1240523402 |
oct | 322650165 |
9 | 124885612 |
10 | 55267445 |
11 | 29219282 |
12 | 16613585 |
13 | b5b0b3c |
14 | 74a92a9 |
15 | 4cba815 |
hex | 34b5075 |
55267445 has 16 divisors (see below), whose sum is σ = 67262832. Its totient is φ = 43591680.
The previous prime is 55267411. The next prime is 55267453. The reversal of 55267445 is 54476255.
55267445 = 1962 + 1972 + ... + 5572.
55267445 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 8 ways, for example, as 2588881 + 52678564 = 1609^2 + 7258^2 .
It is a de Polignac number, because none of the positive numbers 2k-55267445 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55267399 and 55267408.
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 15 ways as a sum of consecutive naturals, for example, 156389 + ... + 156741.
It is an arithmetic number, because the mean of its divisors is an integer number (4203927).
Almost surely, 255267445 is an apocalyptic number.
It is an amenable number.
55267445 is a deficient number, since it is larger than the sum of its proper divisors (11995387).
55267445 is a wasteful number, since it uses less digits than its factorization.
55267445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712.
The product of its digits is 168000, while the sum is 38.
The square root of 55267445 is about 7434.2077587326. The cubic root of 55267445 is about 380.9106621341.
The spelling of 55267445 in words is "fifty-five million, two hundred sixty-seven thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •