Base | Representation |
---|---|
bin | 100000110010100… |
… | …011101100001101 |
3 | 1102100011012200010 |
4 | 200302203230031 |
5 | 2111312434201 |
6 | 130331023433 |
7 | 16426656636 |
oct | 4062435415 |
9 | 1370135603 |
10 | 550124301 |
11 | 262592591 |
12 | 13429ab79 |
13 | 89c84c4c |
14 | 530c288d |
15 | 33469bd6 |
hex | 20ca3b0d |
550124301 has 8 divisors (see below), whose sum is σ = 776646144. Its totient is φ = 345176000.
The previous prime is 550124297. The next prime is 550124303. The reversal of 550124301 is 103421055.
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 550124301 - 22 = 550124297 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550124303) 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, 5393325 + ... + 5393426.
It is an arithmetic number, because the mean of its divisors is an integer number (97080768).
Almost surely, 2550124301 is an apocalyptic number.
550124301 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
550124301 is a deficient number, since it is larger than the sum of its proper divisors (226521843).
550124301 is a wasteful number, since it uses less digits than its factorization.
550124301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10786771.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 550124301 is about 23454.7287556262. The cubic root of 550124301 is about 819.3829886504.
Adding to 550124301 its reverse (103421055), we get a palindrome (653545356).
The spelling of 550124301 in words is "five hundred fifty million, one hundred twenty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •