Base | Representation |
---|---|
bin | 1101001001101… |
… | …1011001001001 |
3 | 10211210112122101 |
4 | 3102123121021 |
5 | 103110144231 |
6 | 5250153401 |
7 | 1236605305 |
oct | 322333111 |
9 | 124715571 |
10 | 55162441 |
11 | 291573a4 |
12 | 16582861 |
13 | b5750c9 |
14 | 747cd05 |
15 | 4c99661 |
hex | 349b649 |
55162441 has 4 divisors (see below), whose sum is σ = 57560832. Its totient is φ = 52764052.
The previous prime is 55162439. The next prime is 55162447. The reversal of 55162441 is 14426155.
55162441 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 55162441 - 21 = 55162439 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55162447) 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 3 ways as a sum of consecutive naturals, for example, 1199161 + ... + 1199206.
It is an arithmetic number, because the mean of its divisors is an integer number (14390208).
Almost surely, 255162441 is an apocalyptic number.
It is an amenable number.
55162441 is a deficient number, since it is larger than the sum of its proper divisors (2398391).
55162441 is a wasteful number, since it uses less digits than its factorization.
55162441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2398390.
The product of its digits is 4800, while the sum is 28.
The square root of 55162441 is about 7427.1421825626. The cubic root of 55162441 is about 380.6692753016.
Adding to 55162441 its reverse (14426155), we get a palindrome (69588596).
The spelling of 55162441 in words is "fifty-five million, one hundred sixty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •