Base | Representation |
---|---|
bin | 10000000001111111110… |
… | …00111010110101101001 |
3 | 1221122210010111101012200 |
4 | 20000333320322311221 |
5 | 33011043342341221 |
6 | 1101014033130413 |
7 | 54540011123346 |
oct | 10007770726551 |
9 | 1848703441180 |
10 | 550827699561 |
11 | 1a2671970477 |
12 | 8a9070b9a09 |
13 | 3cc3451b549 |
14 | 1c93584d7cd |
15 | e4dcec2426 |
hex | 803fe3ad69 |
550827699561 has 12 divisors (see below), whose sum is σ = 797624155380. Its totient is φ = 366302707200.
The previous prime is 550827699557. The next prime is 550827699589. The reversal of 550827699561 is 165996728055.
550827699561 is a `hidden beast` number, since 5 + 5 + 0 + 8 + 2 + 7 + 69 + 9 + 561 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 279345017961 + 271482681600 = 528531^2 + 521040^2 .
It is not a de Polignac number, because 550827699561 - 22 = 550827699557 is a prime.
It is a super-2 number, since 2×5508276995612 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (550826699561) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 76309456 + ... + 76316673.
It is an arithmetic number, because the mean of its divisors is an integer number (66468679615).
Almost surely, 2550827699561 is an apocalyptic number.
It is an amenable number.
550827699561 is a deficient number, since it is larger than the sum of its proper divisors (246796455819).
550827699561 is a wasteful number, since it uses less digits than its factorization.
550827699561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152626536 (or 152626533 counting only the distinct ones).
The product of its (nonzero) digits is 40824000, while the sum is 63.
The spelling of 550827699561 in words is "five hundred fifty billion, eight hundred twenty-seven million, six hundred ninety-nine thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •