Base | Representation |
---|---|
bin | 10111001111001001011010… |
… | …11111011010100111110101 |
3 | 20200220220211201102021211101 |
4 | 23213210231133122213311 |
5 | 23144142140204140431 |
6 | 300402031523010101 |
7 | 13522464543144100 |
oct | 1347445537324765 |
9 | 220826751367741 |
10 | 51097989130741 |
11 | 15310598819263 |
12 | 5893171209931 |
13 | 226869aa19787 |
14 | c892279c7737 |
15 | 5d9298d02961 |
hex | 2e792d7da9f5 |
51097989130741 has 24 divisors (see below), whose sum is σ = 59475342009600. Its totient is φ = 43772621229792.
The previous prime is 51097989130739. The next prime is 51097989130759. The reversal of 51097989130741 is 14703198979015.
It is not a de Polignac number, because 51097989130741 - 21 = 51097989130739 is a prime.
It is a super-2 number, since 2×510979891307412 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51097939130741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1241759035 + ... + 1241800183.
It is an arithmetic number, because the mean of its divisors is an integer number (2478139250400).
Almost surely, 251097989130741 is an apocalyptic number.
It is an amenable number.
51097989130741 is a deficient number, since it is larger than the sum of its proper divisors (8377352878859).
51097989130741 is a wasteful number, since it uses less digits than its factorization.
51097989130741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55393 (or 55386 counting only the distinct ones).
The product of its (nonzero) digits is 17146080, while the sum is 64.
The spelling of 51097989130741 in words is "fifty-one trillion, ninety-seven billion, nine hundred eighty-nine million, one hundred thirty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •