Base | Representation |
---|---|
bin | 110000001000011010… |
… | …011111010101000111 |
3 | 11221101201111002201120 |
4 | 300020122133111013 |
5 | 1321320234104401 |
6 | 35424122125023 |
7 | 3506461201641 |
oct | 601032372507 |
9 | 157351432646 |
10 | 51680769351 |
11 | 1aa104a0a32 |
12 | a023950773 |
13 | 4b480450c3 |
14 | 2703a4b891 |
15 | 15271ea836 |
hex | c0869f547 |
51680769351 has 32 divisors (see below), whose sum is σ = 71075516160. Its totient is φ = 33383798784.
The previous prime is 51680769331. The next prime is 51680769359. The reversal of 51680769351 is 15396708615.
It is not a de Polignac number, because 51680769351 - 234 = 34500900167 is a prime.
It is a super-2 number, since 2×516807693512 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51680769294 and 51680769303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51680769359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9433225 + ... + 9438701.
It is an arithmetic number, because the mean of its divisors is an integer number (2221109880).
Almost surely, 251680769351 is an apocalyptic number.
51680769351 is a deficient number, since it is larger than the sum of its proper divisors (19394746809).
51680769351 is a wasteful number, since it uses less digits than its factorization.
51680769351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6095.
The product of its (nonzero) digits is 1360800, while the sum is 51.
The spelling of 51680769351 in words is "fifty-one billion, six hundred eighty million, seven hundred sixty-nine thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •