Base | Representation |
---|---|
bin | 100000110010000… |
… | …111111011101001 |
3 | 1102022221102201000 |
4 | 200302013323221 |
5 | 2111300314401 |
6 | 130324345213 |
7 | 16426004310 |
oct | 4062077351 |
9 | 1368842630 |
10 | 550010601 |
11 | 262515118 |
12 | 134245209 |
13 | 89c4527a |
14 | 53093277 |
15 | 33446186 |
hex | 20c87ee9 |
550010601 has 32 divisors (see below), whose sum is σ = 933753600. Its totient is φ = 313441920.
The previous prime is 550010599. The next prime is 550010609. The reversal of 550010601 is 106010055.
550010601 is a `hidden beast` number, since 5 + 50 + 0 + 10 + 601 = 666.
550010601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 550010601 - 21 = 550010599 is a prime.
It is a super-2 number, since 2×5500106012 = 605023322424762402, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (550010609) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 69781 + ... + 77261.
It is an arithmetic number, because the mean of its divisors is an integer number (29179800).
Almost surely, 2550010601 is an apocalyptic number.
It is an amenable number.
550010601 is a deficient number, since it is larger than the sum of its proper divisors (383742999).
550010601 is a wasteful number, since it uses less digits than its factorization.
550010601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7886 (or 7880 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 550010601 is about 23452.3048121075. The cubic root of 550010601 is about 819.3265345818.
Adding to 550010601 its reverse (106010055), we get a palindrome (656020656).
The spelling of 550010601 in words is "five hundred fifty million, ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •