Base | Representation |
---|---|
bin | 100000110100000… |
… | …000101000110001 |
3 | 1102100212112220102 |
4 | 200310000220301 |
5 | 2111412130014 |
6 | 130343122145 |
7 | 16433133605 |
oct | 4064005061 |
9 | 1370775812 |
10 | 550505009 |
11 | 26282261a |
12 | 134443355 |
13 | 8a089312 |
14 | 53181505 |
15 | 334e28de |
hex | 20d00a31 |
550505009 has 4 divisors (see below), whose sum is σ = 550570020. Its totient is φ = 550440000.
The previous prime is 550504939. The next prime is 550505017. The reversal of 550505009 is 900505055.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 293608225 + 256896784 = 17135^2 + 16028^2 .
It is a cyclic number.
It is not a de Polignac number, because 550505009 - 228 = 282069553 is a prime.
It is a super-3 number, since 3×5505050093 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (550505029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17492 + ... + 37509.
It is an arithmetic number, because the mean of its divisors is an integer number (137642505).
Almost surely, 2550505009 is an apocalyptic number.
It is an amenable number.
550505009 is a deficient number, since it is larger than the sum of its proper divisors (65011).
550505009 is a wasteful number, since it uses less digits than its factorization.
550505009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65010.
The product of its (nonzero) digits is 5625, while the sum is 29.
The square root of 550505009 is about 23462.8431567873. The cubic root of 550505009 is about 819.5719603223.
The spelling of 550505009 in words is "five hundred fifty million, five hundred five thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •