Base | Representation |
---|---|
bin | 1101010001001… |
… | …1011010110001 |
3 | 10212201112000200 |
4 | 3110103122301 |
5 | 103221412230 |
6 | 5304505413 |
7 | 1244023515 |
oct | 324233261 |
9 | 125645020 |
10 | 55654065 |
11 | 294627a5 |
12 | 1677b269 |
13 | b6b7acc |
14 | 756a145 |
15 | 4d45160 |
hex | 35136b1 |
55654065 has 12 divisors (see below), whose sum is σ = 96467124. Its totient is φ = 29682144.
The previous prime is 55653991. The next prime is 55654069. The reversal of 55654065 is 56045655.
It is a happy number.
55654065 is a `hidden beast` number, since 5 + 56 + 540 + 65 = 666.
55654065 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 2 ways, for example, as 17164449 + 38489616 = 4143^2 + 6204^2 .
It is not a de Polignac number, because 55654065 - 29 = 55653553 is a prime.
It is not an unprimeable number, because it can be changed into a prime (55654069) 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 11 ways as a sum of consecutive naturals, for example, 618334 + ... + 618423.
It is an arithmetic number, because the mean of its divisors is an integer number (8038927).
Almost surely, 255654065 is an apocalyptic number.
It is an amenable number.
55654065 is a deficient number, since it is larger than the sum of its proper divisors (40813059).
55654065 is a wasteful number, since it uses less digits than its factorization.
55654065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1236768 (or 1236765 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 36.
The square root of 55654065 is about 7460.1652126478. The cubic root of 55654065 is about 381.7968113426.
The spelling of 55654065 in words is "fifty-five million, six hundred fifty-four thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •