Base | Representation |
---|---|
bin | 10111001111110010101100… |
… | …00001101011001100101011 |
3 | 20201000001000201210010021010 |
4 | 23213321112001223030223 |
5 | 23200023023333133101 |
6 | 300420134151315003 |
7 | 13524210552554364 |
oct | 1347712601531453 |
9 | 221001021703233 |
10 | 51120144036651 |
11 | 15319a27677a58 |
12 | 589751497ba63 |
13 | 226a7bb997661 |
14 | c8a32a16cb6b |
15 | 5d9b43d2e2d6 |
hex | 2e7e5606b32b |
51120144036651 has 16 divisors (see below), whose sum is σ = 68418086676480. Its totient is φ = 33951203079360.
The previous prime is 51120144036623. The next prime is 51120144036653. The reversal of 51120144036651 is 15663044102115.
It is not a de Polignac number, because 51120144036651 - 27 = 51120144036523 is a prime.
It is a super-2 number, since 2×511201440366512 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51120144036653) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3031411 + ... + 10556028.
It is an arithmetic number, because the mean of its divisors is an integer number (4276130417280).
Almost surely, 251120144036651 is an apocalyptic number.
51120144036651 is a deficient number, since it is larger than the sum of its proper divisors (17297942639829).
51120144036651 is a wasteful number, since it uses less digits than its factorization.
51120144036651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13592186.
The product of its (nonzero) digits is 86400, while the sum is 39.
Adding to 51120144036651 its reverse (15663044102115), we get a palindrome (66783188138766).
The spelling of 51120144036651 in words is "fifty-one trillion, one hundred twenty billion, one hundred forty-four million, thirty-six thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •