Base | Representation |
---|---|
bin | 101111110010111010… |
… | …001111100010000001 |
3 | 11220110120121211122221 |
4 | 233302322033202001 |
5 | 1320100404310442 |
6 | 35324233331041 |
7 | 3464520520132 |
oct | 576272174201 |
9 | 156416554587 |
10 | 51319994497 |
11 | 1a8458874a2 |
12 | 9b42b66a81 |
13 | 4abb388765 |
14 | 26abb77c89 |
15 | 15056d4467 |
hex | bf2e8f881 |
51319994497 has 2 divisors, whose sum is σ = 51319994498. Its totient is φ = 51319994496.
The previous prime is 51319994477. The next prime is 51319994543. The reversal of 51319994497 is 79449991315.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 42195733056 + 9124261441 = 205416^2 + 95521^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51319994497 is a prime.
It is a super-2 number, since 2×513199944972 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51319994447) 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, 25659997248 + 25659997249.
It is an arithmetic number, because the mean of its divisors is an integer number (25659997249).
Almost surely, 251319994497 is an apocalyptic number.
It is an amenable number.
51319994497 is a deficient number, since it is larger than the sum of its proper divisors (1).
51319994497 is an equidigital number, since it uses as much as digits as its factorization.
51319994497 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11022480, while the sum is 61.
The spelling of 51319994497 in words is "fifty-one billion, three hundred nineteen million, nine hundred ninety-four thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •