Base | Representation |
---|---|
bin | 101111001010100010… |
… | …011010110100100001 |
3 | 11211201101002201021211 |
4 | 233022202122310201 |
5 | 1312204010120031 |
6 | 35133115550121 |
7 | 3441654340636 |
oct | 571242326441 |
9 | 154641081254 |
10 | 50642660641 |
11 | 1a528509551 |
12 | 999415b341 |
13 | 4a10c541b1 |
14 | 2645c2018d |
15 | 14b5edcbb1 |
hex | bca89ad21 |
50642660641 has 2 divisors, whose sum is σ = 50642660642. Its totient is φ = 50642660640.
The previous prime is 50642660533. The next prime is 50642660671. The reversal of 50642660641 is 14606624605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43907011600 + 6735649041 = 209540^2 + 82071^2 .
It is a cyclic number.
It is not a de Polignac number, because 50642660641 - 211 = 50642658593 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50642660594 and 50642660603.
It is not a weakly prime, because it can be changed into another prime (50642660671) 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 as a sum of consecutive naturals, namely, 25321330320 + 25321330321.
It is an arithmetic number, because the mean of its divisors is an integer number (25321330321).
Almost surely, 250642660641 is an apocalyptic number.
It is an amenable number.
50642660641 is a deficient number, since it is larger than the sum of its proper divisors (1).
50642660641 is an equidigital number, since it uses as much as digits as its factorization.
50642660641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 207360, while the sum is 40.
The spelling of 50642660641 in words is "fifty billion, six hundred forty-two million, six hundred sixty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •