Base | Representation |
---|---|
bin | 1111111111101000110… |
… | …01000010001111001101 |
3 | 1221112111212001220202020 |
4 | 13333310121002033031 |
5 | 33001000112100221 |
6 | 1100244224320353 |
7 | 54463430564562 |
oct | 7776431021715 |
9 | 1845455056666 |
10 | 549561050061 |
11 | 1a2081981a01 |
12 | 8a612a730b9 |
13 | 3ca91c8c5ba |
14 | 1c855530869 |
15 | e466bbdac6 |
hex | 7ff46423cd |
549561050061 has 12 divisors (see below), whose sum is σ = 753087317472. Its totient is φ = 356472029808.
The previous prime is 549561050057. The next prime is 549561050069. The reversal of 549561050061 is 160050165945.
It is not a de Polignac number, because 549561050061 - 22 = 549561050057 is a prime.
It is a hoax number, since the sum of its digits (42) coincides with the sum of the digits of its distinct prime factors.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 549561049995 and 549561050022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (549561050069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 66901305 + ... + 66909518.
It is an arithmetic number, because the mean of its divisors is an integer number (62757276456).
Almost surely, 2549561050061 is an apocalyptic number.
It is an amenable number.
549561050061 is a deficient number, since it is larger than the sum of its proper divisors (203526267411).
549561050061 is a wasteful number, since it uses less digits than its factorization.
549561050061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133810900 (or 133810863 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 42.
The spelling of 549561050061 in words is "five hundred forty-nine billion, five hundred sixty-one million, fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •