Base | Representation |
---|---|
bin | 100000110011011… |
… | …110100110100101 |
3 | 1102100121110200022 |
4 | 200303132212211 |
5 | 2111343144410 |
6 | 130340124525 |
7 | 16432013306 |
oct | 4063364645 |
9 | 1370543608 |
10 | 550365605 |
11 | 262737909 |
12 | 134396745 |
13 | 8a03aa2a |
14 | 531467ad |
15 | 334b6455 |
hex | 20cde9a5 |
550365605 has 8 divisors (see below), whose sum is σ = 660975000. Its totient is φ = 439934976.
The previous prime is 550365601. The next prime is 550365611. The reversal of 550365605 is 506563055.
550365605 is digitally balanced in base 2 and base 6, because in such bases 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 9431041 + 540934564 = 3071^2 + 23258^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 550365605 - 22 = 550365601 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550365601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37820 + ... + 50309.
It is an arithmetic number, because the mean of its divisors is an integer number (82621875).
Almost surely, 2550365605 is an apocalyptic number.
It is an amenable number.
550365605 is a deficient number, since it is larger than the sum of its proper divisors (110609395).
550365605 is a wasteful number, since it uses less digits than its factorization.
550365605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89383.
The product of its (nonzero) digits is 67500, while the sum is 35.
The square root of 550365605 is about 23459.8722289786. The cubic root of 550365605 is about 819.5027746032.
The spelling of 550365605 in words is "five hundred fifty million, three hundred sixty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •