Base | Representation |
---|---|
bin | 101111100000000101… |
… | …011010110101100001 |
3 | 11212122120022122110021 |
4 | 233200011122311201 |
5 | 1313424031013111 |
6 | 35233032033441 |
7 | 3453634120000 |
oct | 574005326541 |
9 | 155576278407 |
10 | 51004157281 |
11 | 1a6a3576300 |
12 | 9a75232881 |
13 | 4a6ab0422c |
14 | 267bc40c37 |
15 | 14d7ae7d71 |
hex | be015ad61 |
51004157281 has 45 divisors (see below), whose sum is σ = 65558729873. Its totient is φ = 39648645960.
The previous prime is 51004157261. The next prime is 51004157297. The reversal of 51004157281 is 18275140015.
The square root of 51004157281 is 225841.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 51004157281 - 219 = 51003632993 is a prime.
It is a super-2 number, since 2×510041572812 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51004157201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 121728090 + ... + 121728508.
Almost surely, 251004157281 is an apocalyptic number.
51004157281 is the 225841-st square number.
51004157281 is the 112921-st centered octagonal number.
It is an amenable number.
51004157281 is a deficient number, since it is larger than the sum of its proper divisors (14554572592).
51004157281 is an frugal number, since it uses more digits than its factorization.
51004157281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888 (or 437 counting only the distinct ones).
The product of its (nonzero) digits is 11200, while the sum is 34.
Adding to 51004157281 its reverse (18275140015), we get a palindrome (69279297296).
The spelling of 51004157281 in words is "fifty-one billion, four million, one hundred fifty-seven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •