Base | Representation |
---|---|
bin | 101111100110101001… |
… | …110100001100111101 |
3 | 11212221020200121102222 |
4 | 233212221310030331 |
5 | 1314140234033121 |
6 | 35252010055125 |
7 | 3456442622366 |
oct | 574651641475 |
9 | 155836617388 |
10 | 51114361661 |
11 | 1a74a7a7500 |
12 | 9aa611a4a5 |
13 | 4a878ab61c |
14 | 268c72ab6d |
15 | 14e26160ab |
hex | be6a7433d |
51114361661 has 12 divisors (see below), whose sum is σ = 56344585500. Its totient is φ = 46334418240.
The previous prime is 51114361607. The next prime is 51114361679. The reversal of 51114361661 is 16616341115.
It can be written as a sum of positive squares in 2 ways, for example, as 24556770436 + 26557591225 = 156706^2 + 162965^2 .
It is not a de Polignac number, because 51114361661 - 210 = 51114360637 is a prime.
It is a super-2 number, since 2×511143616612 (a number of 22 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (35) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51114361061) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 562976 + ... + 647433.
It is an arithmetic number, because the mean of its divisors is an integer number (4695382125).
Almost surely, 251114361661 is an apocalyptic number.
It is an amenable number.
51114361661 is a deficient number, since it is larger than the sum of its proper divisors (5230223839).
51114361661 is a wasteful number, since it uses less digits than its factorization.
51114361661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1210780 (or 1210769 counting only the distinct ones).
The product of its digits is 12960, while the sum is 35.
The spelling of 51114361661 in words is "fifty-one billion, one hundred fourteen million, three hundred sixty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •