Base | Representation |
---|---|
bin | 10110110000111101111111… |
… | …01110110100011101001101 |
3 | 20120020210100101100221001221 |
4 | 23120132333232310131031 |
5 | 23030200023000302441 |
6 | 254245422253003341 |
7 | 13354535514532462 |
oct | 1330367756643515 |
9 | 216223311327057 |
10 | 50061060556621 |
11 | 14a5085a660024 |
12 | 5746203a83551 |
13 | 21c1978b0075a |
14 | c50d7ac8d669 |
15 | 5bc30a5568d1 |
hex | 2d87bfbb474d |
50061060556621 has 2 divisors, whose sum is σ = 50061060556622. Its totient is φ = 50061060556620.
The previous prime is 50061060556583. The next prime is 50061060556627. The reversal of 50061060556621 is 12665506016005.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31829783120521 + 18231277436100 = 5641789^2 + 4269810^2 .
It is a cyclic number.
It is not a de Polignac number, because 50061060556621 - 227 = 50060926338893 is a prime.
It is a super-2 number, since 2×500610605566212 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50061060556627) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25030530278310 + 25030530278311.
It is an arithmetic number, because the mean of its divisors is an integer number (25030530278311).
Almost surely, 250061060556621 is an apocalyptic number.
It is an amenable number.
50061060556621 is a deficient number, since it is larger than the sum of its proper divisors (1).
50061060556621 is an equidigital number, since it uses as much as digits as its factorization.
50061060556621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 43.
The spelling of 50061060556621 in words is "fifty trillion, sixty-one billion, sixty million, five hundred fifty-six thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •