Base | Representation |
---|---|
bin | 110000000100100101… |
… | …100100011000010011 |
3 | 11221020020200011120120 |
4 | 300010211210120103 |
5 | 1321202320033010 |
6 | 35413510041323 |
7 | 3505051363350 |
oct | 600445443023 |
9 | 157206604516 |
10 | 51616564755 |
11 | 1a988229088 |
12 | a006349243 |
13 | 4b37955412 |
14 | 26d92d7627 |
15 | 1521766e70 |
hex | c04964613 |
51616564755 has 32 divisors (see below), whose sum is σ = 99936612864. Its totient is φ = 22208134656.
The previous prime is 51616564733. The next prime is 51616564817. The reversal of 51616564755 is 55746561615.
It is not a de Polignac number, because 51616564755 - 28 = 51616564499 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 51616564698 and 51616564707.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 14456637 + ... + 14460206.
It is an arithmetic number, because the mean of its divisors is an integer number (3123019152).
Almost surely, 251616564755 is an apocalyptic number.
51616564755 is a deficient number, since it is larger than the sum of its proper divisors (48320048109).
51616564755 is a wasteful number, since it uses less digits than its factorization.
51616564755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28916875.
The product of its digits is 3780000, while the sum is 51.
The spelling of 51616564755 in words is "fifty-one billion, six hundred sixteen million, five hundred sixty-four thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •