Base | Representation |
---|---|
bin | 10111011101110010111011… |
… | …11100111000011111011101 |
3 | 20202201001000020201002101211 |
4 | 23232321131330320133131 |
5 | 23230413442203212021 |
6 | 301425152135304421 |
7 | 13604033435246014 |
oct | 1356713574703735 |
9 | 222631006632354 |
10 | 51601313335261 |
11 | 15494aa3152818 |
12 | 595481b51b111 |
13 | 22a3ca1772971 |
14 | ca57344c7a7b |
15 | 5e74066ba3e1 |
hex | 2eee5df387dd |
51601313335261 has 16 divisors (see below), whose sum is σ = 52661886393600. Its totient is φ = 50559151830720.
The previous prime is 51601313335259. The next prime is 51601313335289. The reversal of 51601313335261 is 16253331310615.
It is not a de Polignac number, because 51601313335261 - 21 = 51601313335259 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51601313338261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 64188645 + ... + 64987573.
It is an arithmetic number, because the mean of its divisors is an integer number (3291367899600).
Almost surely, 251601313335261 is an apocalyptic number.
It is an amenable number.
51601313335261 is a deficient number, since it is larger than the sum of its proper divisors (1060573058339).
51601313335261 is an frugal number, since it uses more digits than its factorization.
51601313335261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 799297 (or 799139 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 40.
Adding to 51601313335261 its reverse (16253331310615), we get a palindrome (67854644645876).
The spelling of 51601313335261 in words is "fifty-one trillion, six hundred one billion, three hundred thirteen million, three hundred thirty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •