Base | Representation |
---|---|
bin | 10000000001111001101… |
… | …10001000001011101101 |
3 | 1221122122120102002100220 |
4 | 20000330312020023231 |
5 | 33010442304324031 |
6 | 1101005010441553 |
7 | 54535521106404 |
oct | 10007466101355 |
9 | 1848576362326 |
10 | 550776636141 |
11 | 1a26460637a6 |
12 | 8a8b1b932b9 |
13 | 3cc26a800c4 |
14 | 1c92cb5a63b |
15 | e4d8787596 |
hex | 803cd882ed |
550776636141 has 8 divisors (see below), whose sum is σ = 766297928640. Its totient is φ = 351219883872.
The previous prime is 550776636127. The next prime is 550776636167. The reversal of 550776636141 is 141636677055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 550776636141 - 227 = 550642418413 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550776646141) 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, 3991134976 + ... + 3991135113.
It is an arithmetic number, because the mean of its divisors is an integer number (95787241080).
Almost surely, 2550776636141 is an apocalyptic number.
It is an amenable number.
550776636141 is a deficient number, since it is larger than the sum of its proper divisors (215521292499).
550776636141 is a wasteful number, since it uses less digits than its factorization.
550776636141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7982270115.
The product of its (nonzero) digits is 3175200, while the sum is 51.
The spelling of 550776636141 in words is "five hundred fifty billion, seven hundred seventy-six million, six hundred thirty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •