Base | Representation |
---|---|
bin | 101111111010101110… |
… | …001111001110001101 |
3 | 11220210201020220220111 |
4 | 233322232033032031 |
5 | 1320332433041404 |
6 | 35345234520021 |
7 | 3501001560424 |
oct | 577256171615 |
9 | 156721226814 |
10 | 51451065229 |
11 | 1a90286a913 |
12 | 9b7aa36011 |
13 | 4b0c58a6c5 |
14 | 26c13362bb |
15 | 1511e75104 |
hex | bfab8f38d |
51451065229 has 2 divisors, whose sum is σ = 51451065230. Its totient is φ = 51451065228.
The previous prime is 51451065217. The next prime is 51451065283. The reversal of 51451065229 is 92256015415.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 36673016004 + 14778049225 = 191502^2 + 121565^2 .
It is a cyclic number.
It is not a de Polignac number, because 51451065229 - 219 = 51450540941 is a prime.
It is a super-3 number, since 3×514510652293 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 51451065191 and 51451065200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51451065929) 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, 25725532614 + 25725532615.
It is an arithmetic number, because the mean of its divisors is an integer number (25725532615).
Almost surely, 251451065229 is an apocalyptic number.
It is an amenable number.
51451065229 is a deficient number, since it is larger than the sum of its proper divisors (1).
51451065229 is an equidigital number, since it uses as much as digits as its factorization.
51451065229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108000, while the sum is 40.
The spelling of 51451065229 in words is "fifty-one billion, four hundred fifty-one million, sixty-five thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •