Base | Representation |
---|---|
bin | 10111010000101101000111… |
… | …01101111101010110101101 |
3 | 20201010000222211122002001102 |
4 | 23220112203231331112231 |
5 | 23201031244114341221 |
6 | 300442402541252445 |
7 | 13526401105226531 |
oct | 1350264355752655 |
9 | 221100884562042 |
10 | 51151512262061 |
11 | 15331264177a92 |
12 | 58a1609b64125 |
13 | 227074a664593 |
14 | c8ba641b7bc1 |
15 | 5da87cb2330b |
hex | 2e85a3b7d5ad |
51151512262061 has 2 divisors, whose sum is σ = 51151512262062. Its totient is φ = 51151512262060.
The previous prime is 51151512261953. The next prime is 51151512262133. The reversal of 51151512262061 is 16026221515115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 45969674648836 + 5181837613225 = 6780094^2 + 2276365^2 .
It is a cyclic number.
It is not a de Polignac number, because 51151512262061 - 226 = 51151445153197 is a prime.
It is a super-2 number, since 2×511515122620612 (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 (51151512262261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25575756131030 + 25575756131031.
It is an arithmetic number, because the mean of its divisors is an integer number (25575756131031).
Almost surely, 251151512262061 is an apocalyptic number.
It is an amenable number.
51151512262061 is a deficient number, since it is larger than the sum of its proper divisors (1).
51151512262061 is an equidigital number, since it uses as much as digits as its factorization.
51151512262061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36000, while the sum is 38.
Adding to 51151512262061 its reverse (16026221515115), we get a palindrome (67177733777176).
The spelling of 51151512262061 in words is "fifty-one trillion, one hundred fifty-one billion, five hundred twelve million, two hundred sixty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •