Base | Representation |
---|---|
bin | 110000001000001010… |
… | …010111001101000001 |
3 | 11221101102112022120011 |
4 | 300020022113031001 |
5 | 1321313143314021 |
6 | 35423451344521 |
7 | 3506410233415 |
oct | 601012271501 |
9 | 157342468504 |
10 | 51676541761 |
11 | 1aa09073759 |
12 | a022452141 |
13 | 4b471c4a80 |
14 | 270326ad45 |
15 | 1526b62de1 |
hex | c08297341 |
51676541761 has 4 divisors (see below), whose sum is σ = 55651660372. Its totient is φ = 47701423152.
The previous prime is 51676541759. The next prime is 51676541779. The reversal of 51676541761 is 16714567615.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10700661136 + 40975880625 = 103444^2 + 202425^2 .
It is a cyclic number.
It is not a de Polignac number, because 51676541761 - 21 = 51676541759 is a prime.
It is a super-2 number, since 2×516765417612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51676551761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1987559286 + ... + 1987559311.
It is an arithmetic number, because the mean of its divisors is an integer number (13912915093).
Almost surely, 251676541761 is an apocalyptic number.
It is an amenable number.
51676541761 is a deficient number, since it is larger than the sum of its proper divisors (3975118611).
51676541761 is a wasteful number, since it uses less digits than its factorization.
51676541761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3975118610.
The product of its digits is 1058400, while the sum is 49.
The spelling of 51676541761 in words is "fifty-one billion, six hundred seventy-six million, five hundred forty-one thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •