Base | Representation |
---|---|
bin | 101111000101100111… |
… | …010010001110001101 |
3 | 11211111121122122212201 |
4 | 233011213102032031 |
5 | 1312021333100221 |
6 | 35121005201501 |
7 | 3436632222523 |
oct | 570547221615 |
9 | 154447578781 |
10 | 50560050061 |
11 | 1a495914a44 |
12 | 9970560291 |
13 | 49c9abb7b1 |
14 | 2638c78313 |
15 | 14adb20891 |
hex | bc59d238d |
50560050061 has 2 divisors, whose sum is σ = 50560050062. Its totient is φ = 50560050060.
The previous prime is 50560050053. The next prime is 50560050083. The reversal of 50560050061 is 16005006505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27294344100 + 23265705961 = 165210^2 + 152531^2 .
It is a cyclic number.
It is not a de Polignac number, because 50560050061 - 23 = 50560050053 is a prime.
It is a super-2 number, since 2×505600500612 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50560050001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25280025030 + 25280025031.
It is an arithmetic number, because the mean of its divisors is an integer number (25280025031).
Almost surely, 250560050061 is an apocalyptic number.
It is an amenable number.
50560050061 is a deficient number, since it is larger than the sum of its proper divisors (1).
50560050061 is an equidigital number, since it uses as much as digits as its factorization.
50560050061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 50560050061 its reverse (16005006505), we get a palindrome (66565056566).
The spelling of 50560050061 in words is "fifty billion, five hundred sixty million, fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •