Base | Representation |
---|---|
bin | 10111011000010001010111… |
… | …11011100101010100011001 |
3 | 20202000220001112002122212211 |
4 | 23230020223323211110121 |
5 | 23214311220331312021 |
6 | 301202040502035121 |
7 | 13554233534011432 |
oct | 1354105373452431 |
9 | 222026045078784 |
10 | 51411495572761 |
11 | 15421546a57335 |
12 | 5923a85a18aa1 |
13 | 228c110b193bc |
14 | c9a488846489 |
15 | 5e24e71003e1 |
hex | 2ec22bee5519 |
51411495572761 has 9 divisors (see below), whose sum is σ = 53744136577621. Its totient is φ = 49176055412572.
The previous prime is 51411495572729. The next prime is 51411495572791. The reversal of 51411495572761 is 16727559411415.
The square root of 51411495572761 is 7170181.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 51411495572761 - 25 = 51411495572729 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51411495572696 and 51411495572705.
It is not an unprimeable number, because it can be changed into a prime (51411495572791) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 164758290 + ... + 165070036.
Almost surely, 251411495572761 is an apocalyptic number.
51411495572761 is the 7170181-st square number.
51411495572761 is the 3585091-st centered octagonal number.
It is an amenable number.
51411495572761 is a deficient number, since it is larger than the sum of its proper divisors (2332641004860).
51411495572761 is an frugal number, since it uses more digits than its factorization.
51411495572761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 623540 (or 311770 counting only the distinct ones).
The product of its digits is 10584000, while the sum is 58.
The spelling of 51411495572761 in words is "fifty-one trillion, four hundred eleven billion, four hundred ninety-five million, five hundred seventy-two thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •