Base | Representation |
---|---|
bin | 101111100010110110… |
… | …110101110001110001 |
3 | 11212202210211120221221 |
4 | 233202312311301301 |
5 | 1314022432321441 |
6 | 35241412545041 |
7 | 3455040340126 |
oct | 574266656161 |
9 | 155683746857 |
10 | 51050667121 |
11 | 1a717852893 |
12 | 9a88922181 |
13 | 4a77639b4c |
14 | 26840aa74d |
15 | 14dbc338d1 |
hex | be2db5c71 |
51050667121 has 2 divisors, whose sum is σ = 51050667122. Its totient is φ = 51050667120.
The previous prime is 51050667091. The next prime is 51050667211. The reversal of 51050667121 is 12176605015.
Together with next prime (51050667211) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51047076096 + 3591025 = 225936^2 + 1895^2 .
It is a cyclic number.
It is not a de Polignac number, because 51050667121 - 27 = 51050666993 is a prime.
It is a super-2 number, since 2×510506671212 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51050665121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25525333560 + 25525333561.
It is an arithmetic number, because the mean of its divisors is an integer number (25525333561).
Almost surely, 251050667121 is an apocalyptic number.
It is an amenable number.
51050667121 is a deficient number, since it is larger than the sum of its proper divisors (1).
51050667121 is an equidigital number, since it uses as much as digits as its factorization.
51050667121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 34.
The spelling of 51050667121 in words is "fifty-one billion, fifty million, six hundred sixty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •