Base | Representation |
---|---|
bin | 101111100010110100… |
… | …100000101111001011 |
3 | 11212202202200120112221 |
4 | 233202310200233023 |
5 | 1314022303303101 |
6 | 35241351514511 |
7 | 3455032215256 |
oct | 574264405713 |
9 | 155682616487 |
10 | 51050056651 |
11 | 1a717476170 |
12 | 9a88688a37 |
13 | 4a77485019 |
14 | 2683d8c09d |
15 | 14dbb62aa1 |
hex | be2d20bcb |
51050056651 has 16 divisors (see below), whose sum is σ = 57522060288. Its totient is φ = 44885037600.
The previous prime is 51050056633. The next prime is 51050056661. The reversal of 51050056651 is 15665005015.
It is a cyclic number.
It is not a de Polignac number, because 51050056651 - 215 = 51050023883 is a prime.
It is a super-2 number, since 2×510500566512 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51050056661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 533100 + ... + 621526.
It is an arithmetic number, because the mean of its divisors is an integer number (3595128768).
Almost surely, 251050056651 is an apocalyptic number.
51050056651 is a deficient number, since it is larger than the sum of its proper divisors (6472003637).
51050056651 is a wasteful number, since it uses less digits than its factorization.
51050056651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90162.
The product of its (nonzero) digits is 22500, while the sum is 34.
The spelling of 51050056651 in words is "fifty-one billion, fifty million, fifty-six thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •