Base | Representation |
---|---|
bin | 10000000001100100101… |
… | …10100110101111010100 |
3 | 1221122012022011112220112 |
4 | 20000302112212233110 |
5 | 33010112223204112 |
6 | 1100535321422152 |
7 | 54531252612143 |
oct | 10006226465724 |
9 | 1848168145815 |
10 | 550600600532 |
11 | 1a2565759624 |
12 | 8a86303a958 |
13 | 3cbc9466818 |
14 | 1c91361575a |
15 | e4c80b3a22 |
hex | 80325a6bd4 |
550600600532 has 6 divisors (see below), whose sum is σ = 963551050938. Its totient is φ = 275300300264.
The previous prime is 550600600531. The next prime is 550600600567. The reversal of 550600600532 is 235006006055.
It can be written as a sum of positive squares in only one way, i.e., 366417144976 + 184183455556 = 605324^2 + 429166^2 .
It is a super-2 number, since 2×5506006005322 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550600600531) 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 as a sum of consecutive naturals, namely, 68825075063 + ... + 68825075070.
It is an arithmetic number, because the mean of its divisors is an integer number (160591841823).
Almost surely, 2550600600532 is an apocalyptic number.
It is an amenable number.
550600600532 is a deficient number, since it is larger than the sum of its proper divisors (412950450406).
550600600532 is a wasteful number, since it uses less digits than its factorization.
550600600532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137650150137 (or 137650150135 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 32.
Adding to 550600600532 its reverse (235006006055), we get a palindrome (785606606587).
The spelling of 550600600532 in words is "five hundred fifty billion, six hundred million, six hundred thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •