Base | Representation |
---|---|
bin | 101111100001011111… |
… | …000110000101100011 |
3 | 11212201012112222022211 |
4 | 233201133012011203 |
5 | 1314001040242001 |
6 | 35235231542551 |
7 | 3454340666233 |
oct | 574137060543 |
9 | 155635488284 |
10 | 51027665251 |
11 | 1a705872182 |
12 | 9a8108aa57 |
13 | 4a72945284 |
14 | 2680dddcc3 |
15 | 14d9bdd351 |
hex | be17c6163 |
51027665251 has 2 divisors, whose sum is σ = 51027665252. Its totient is φ = 51027665250.
The previous prime is 51027665209. The next prime is 51027665257. The reversal of 51027665251 is 15256672015.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51027665251 - 29 = 51027664739 is a prime.
It is a super-2 number, since 2×510276652512 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51027665257) 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, 25513832625 + 25513832626.
It is an arithmetic number, because the mean of its divisors is an integer number (25513832626).
Almost surely, 251027665251 is an apocalyptic number.
51027665251 is a deficient number, since it is larger than the sum of its proper divisors (1).
51027665251 is an equidigital number, since it uses as much as digits as its factorization.
51027665251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126000, while the sum is 40.
The spelling of 51027665251 in words is "fifty-one billion, twenty-seven million, six hundred sixty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •