Base | Representation |
---|---|
bin | 101111111000101011… |
… | …001111010111010101 |
3 | 11220201022122020220021 |
4 | 233320223033113111 |
5 | 1320300140144244 |
6 | 35342010505141 |
7 | 3500103644122 |
oct | 577053172725 |
9 | 156638566807 |
10 | 51416724949 |
11 | 1a895445517 |
12 | 9b6b4351b1 |
13 | 4b05426005 |
14 | 26ba957749 |
15 | 150de40284 |
hex | bf8acf5d5 |
51416724949 has 2 divisors, whose sum is σ = 51416724950. Its totient is φ = 51416724948.
The previous prime is 51416724889. The next prime is 51416724967. The reversal of 51416724949 is 94942761415.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29967072100 + 21449652849 = 173110^2 + 146457^2 .
It is a cyclic number.
It is not a de Polignac number, because 51416724949 - 211 = 51416722901 is a prime.
It is a super-2 number, since 2×514167249492 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51416724896 and 51416724905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51416724649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25708362474 + 25708362475.
It is an arithmetic number, because the mean of its divisors is an integer number (25708362475).
Almost surely, 251416724949 is an apocalyptic number.
It is an amenable number.
51416724949 is a deficient number, since it is larger than the sum of its proper divisors (1).
51416724949 is an equidigital number, since it uses as much as digits as its factorization.
51416724949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2177280, while the sum is 52.
The spelling of 51416724949 in words is "fifty-one billion, four hundred sixteen million, seven hundred twenty-four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •