Base | Representation |
---|---|
bin | 111110100101101010001011… |
… | …0101000011001000001000101 |
3 | 2200012021111101221122021200120 |
4 | 1331023110112220121001011 |
5 | 1034124420234124434212 |
6 | 5230515345243132153 |
7 | 223650511253340234 |
oct | 17513242650310105 |
9 | 2605244357567616 |
10 | 550533582655557 |
11 | 14a464a88034546 |
12 | 518b511ab14059 |
13 | 1a82612b916147 |
14 | 99d3d79048b1b |
15 | 439a9965a288c |
hex | 1f4b516a19045 |
550533582655557 has 16 divisors (see below), whose sum is σ = 735736967143680. Its totient is φ = 366177265272000.
The previous prime is 550533582655543. The next prime is 550533582655559. The reversal of 550533582655557 is 755556285335055.
It is not a de Polignac number, because 550533582655557 - 210 = 550533582654533 is a prime.
It is a super-2 number, since 2×5505335826555572 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 550533582655491 and 550533582655500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550533582655559) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 119229694 + ... + 123761007.
It is an arithmetic number, because the mean of its divisors is an integer number (45983560446480).
Almost surely, 2550533582655557 is an apocalyptic number.
It is an amenable number.
550533582655557 is a deficient number, since it is larger than the sum of its proper divisors (185203384488123).
550533582655557 is a wasteful number, since it uses less digits than its factorization.
550533582655557 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242992444.
The product of its (nonzero) digits is 2362500000, while the sum is 69.
The spelling of 550533582655557 in words is "five hundred fifty trillion, five hundred thirty-three billion, five hundred eighty-two million, six hundred fifty-five thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •