Base | Representation |
---|---|
bin | 10000000001010100011… |
… | …10010111111100001001 |
3 | 1221121211210112221220010 |
4 | 20000222032113330021 |
5 | 33004322320200113 |
6 | 1100514010422133 |
7 | 54525005466012 |
oct | 10005216277411 |
9 | 1847753487803 |
10 | 550464225033 |
11 | 1a24a57826a8 |
12 | 8a825431949 |
13 | 3cba7128168 |
14 | 1c8dd476009 |
15 | e4bb1261c3 |
hex | 802a397f09 |
550464225033 has 8 divisors (see below), whose sum is σ = 733959755008. Its totient is φ = 366972422544.
The previous prime is 550464225001. The next prime is 550464225043. The reversal of 550464225033 is 330522464055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 550464225033 - 25 = 550464225001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 550464224982 and 550464225000.
It is not an unprimeable number, because it can be changed into a prime (550464225043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 566866 + ... + 1192587.
It is an arithmetic number, because the mean of its divisors is an integer number (91744969376).
Almost surely, 2550464225033 is an apocalyptic number.
It is an amenable number.
550464225033 is a deficient number, since it is larger than the sum of its proper divisors (183495529975).
550464225033 is a wasteful number, since it uses less digits than its factorization.
550464225033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1863743.
The product of its (nonzero) digits is 432000, while the sum is 39.
Adding to 550464225033 its reverse (330522464055), we get a palindrome (880986689088).
The spelling of 550464225033 in words is "five hundred fifty billion, four hundred sixty-four million, two hundred twenty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •