Base | Representation |
---|---|
bin | 1101010001100… |
… | …0101100111001 |
3 | 10212202121201011 |
4 | 3110120230321 |
5 | 103223110310 |
6 | 5305153521 |
7 | 1244143561 |
oct | 324305471 |
9 | 125677634 |
10 | 55675705 |
11 | 29477a88 |
12 | 1678b8a1 |
13 | b6c4907 |
14 | 7573da1 |
15 | 4d4b78a |
hex | 3518b39 |
55675705 has 8 divisors (see below), whose sum is σ = 68071752. Its totient is φ = 43699968.
The previous prime is 55675703. The next prime is 55675717. The reversal of 55675705 is 50757655.
55675705 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 4 ways, for example, as 11943936 + 43731769 = 3456^2 + 6613^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55675705 - 21 = 55675703 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55675703) 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 7 ways as a sum of consecutive naturals, for example, 104784 + ... + 105313.
It is an arithmetic number, because the mean of its divisors is an integer number (8508969).
Almost surely, 255675705 is an apocalyptic number.
It is an amenable number.
55675705 is a deficient number, since it is larger than the sum of its proper divisors (12396047).
55675705 is a wasteful number, since it uses less digits than its factorization.
55675705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210155.
The product of its (nonzero) digits is 183750, while the sum is 40.
The square root of 55675705 is about 7461.6154417123. The cubic root of 55675705 is about 381.8462896833.
The spelling of 55675705 in words is "fifty-five million, six hundred seventy-five thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •