Base | Representation |
---|---|
bin | 1101001010011… |
… | …1101000010101 |
3 | 10211220002101211 |
4 | 3102213220111 |
5 | 103113300230 |
6 | 5251221421 |
7 | 1240204402 |
oct | 322475025 |
9 | 124802354 |
10 | 55212565 |
11 | 29191021 |
12 | 165a7871 |
13 | b591b75 |
14 | 74932a9 |
15 | 4ca942a |
hex | 34a7a15 |
55212565 has 4 divisors (see below), whose sum is σ = 66255084. Its totient is φ = 44170048.
The previous prime is 55212557. The next prime is 55212569. The reversal of 55212565 is 56521255.
55212565 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.
It can be written as a sum of positive squares in 2 ways, for example, as 37039396 + 18173169 = 6086^2 + 4263^2 .
It is a cyclic number.
It is not a de Polignac number, because 55212565 - 23 = 55212557 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55212569) 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, 5521252 + ... + 5521261.
It is an arithmetic number, because the mean of its divisors is an integer number (16563771).
Almost surely, 255212565 is an apocalyptic number.
It is an amenable number.
55212565 is a deficient number, since it is larger than the sum of its proper divisors (11042519).
55212565 is a wasteful number, since it uses less digits than its factorization.
55212565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11042518.
The product of its digits is 15000, while the sum is 31.
The square root of 55212565 is about 7430.5157963630. The cubic root of 55212565 is about 380.7845402659.
The spelling of 55212565 in words is "fifty-five million, two hundred twelve thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •