Base | Representation |
---|---|
bin | 1100110001111… |
… | …0000110010101 |
3 | 10201212012021200 |
4 | 3030132012111 |
5 | 102210210121 |
6 | 5152503113 |
7 | 1220412102 |
oct | 314360625 |
9 | 121765250 |
10 | 53600661 |
11 | 2828aa74 |
12 | 15b4aa99 |
13 | b14928a |
14 | 7193aa9 |
15 | 4a8ba26 |
hex | 331e195 |
53600661 has 18 divisors (see below), whose sum is σ = 79290198. Its totient is φ = 34891920.
The previous prime is 53600647. The next prime is 53600663. The reversal of 53600661 is 16600635.
53600661 is a `hidden beast` number, since 53 + 600 + 6 + 6 + 1 = 666.
53600661 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 only one way, i.e., 50339025 + 3261636 = 7095^2 + 1806^2 .
It is not a de Polignac number, because 53600661 - 25 = 53600629 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53600663) 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 17 ways as a sum of consecutive naturals, for example, 15031 + ... + 18251.
It is an arithmetic number, because the mean of its divisors is an integer number (4405011).
Almost surely, 253600661 is an apocalyptic number.
It is an amenable number.
53600661 is a deficient number, since it is larger than the sum of its proper divisors (25689537).
53600661 is a wasteful number, since it uses less digits than its factorization.
53600661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3313 (or 3267 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 53600661 is about 7321.2472298100. The cubic root of 53600661 is about 377.0422760978.
The spelling of 53600661 in words is "fifty-three million, six hundred thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •