Base | Representation |
---|---|
bin | 10111010101011100011010… |
… | …00000101011110101001101 |
3 | 20201200121021120211212000012 |
4 | 23222232031000223311031 |
5 | 23211213232023133201 |
6 | 301045252110043005 |
7 | 13544224116504254 |
oct | 1352561500536515 |
9 | 221617246755005 |
10 | 51314340052301 |
11 | 15394320219877 |
12 | 59090907a9465 |
13 | 2282bc970b661 |
14 | c958ad4a779b |
15 | 5dec0c9895bb |
hex | 2eab8d02bd4d |
51314340052301 has 2 divisors, whose sum is σ = 51314340052302. Its totient is φ = 51314340052300.
The previous prime is 51314340052291. The next prime is 51314340052337. The reversal of 51314340052301 is 10325004341315.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51308941476676 + 5398575625 = 7163026^2 + 73475^2 .
It is a cyclic number.
It is not a de Polignac number, because 51314340052301 - 222 = 51314335857997 is a prime.
It is a super-2 number, since 2×513143400523012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51314340052351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25657170026150 + 25657170026151.
It is an arithmetic number, because the mean of its divisors is an integer number (25657170026151).
Almost surely, 251314340052301 is an apocalyptic number.
It is an amenable number.
51314340052301 is a deficient number, since it is larger than the sum of its proper divisors (1).
51314340052301 is an equidigital number, since it uses as much as digits as its factorization.
51314340052301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 51314340052301 its reverse (10325004341315), we get a palindrome (61639344393616).
The spelling of 51314340052301 in words is "fifty-one trillion, three hundred fourteen billion, three hundred forty million, fifty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •