Base | Representation |
---|---|
bin | 1100001110100… |
… | …1001011001011 |
3 | 10120111122011120 |
4 | 3003221023023 |
5 | 101112133411 |
6 | 5031130323 |
7 | 1161633666 |
oct | 303511313 |
9 | 116448146 |
10 | 51286731 |
11 | 26a4a531 |
12 | 152139a3 |
13 | a818ca2 |
14 | 6b506dd |
15 | 4781106 |
hex | 30e92cb |
51286731 has 4 divisors (see below), whose sum is σ = 68382312. Its totient is φ = 34191152.
The previous prime is 51286727. The next prime is 51286751. The reversal of 51286731 is 13768215.
51286731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 51286731 - 22 = 51286727 is a prime.
It is a super-2 number, since 2×512867312 = 5260657553332722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51286692 and 51286701.
It is not an unprimeable number, because it can be changed into a prime (51286751) 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, 8547786 + ... + 8547791.
It is an arithmetic number, because the mean of its divisors is an integer number (17095578).
Almost surely, 251286731 is an apocalyptic number.
51286731 is a deficient number, since it is larger than the sum of its proper divisors (17095581).
51286731 is a wasteful number, since it uses less digits than its factorization.
51286731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17095580.
The product of its digits is 10080, while the sum is 33.
The square root of 51286731 is about 7161.4754764643. The cubic root of 51286731 is about 371.5366600962.
The spelling of 51286731 in words is "fifty-one million, two hundred eighty-six thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •