Base | Representation |
---|---|
bin | 1100001010100… |
… | …0001010110101 |
3 | 10120000002221000 |
4 | 3002220022311 |
5 | 101030123334 |
6 | 5021313513 |
7 | 1156444503 |
oct | 302501265 |
9 | 116002830 |
10 | 51020469 |
11 | 26888485 |
12 | 15105899 |
13 | a754a36 |
14 | 6ac1673 |
15 | 472c299 |
hex | 30a82b5 |
51020469 has 8 divisors (see below), whose sum is σ = 75585920. Its totient is φ = 34013628.
The previous prime is 51020443. The next prime is 51020471. The reversal of 51020469 is 96402015.
It is not a de Polignac number, because 51020469 - 27 = 51020341 is a prime.
It is a super-2 number, since 2×510204692 = 5206176513959922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1889647 = 51020469 / (5 + 1 + 0 + 2 + 0 + 4 + 6 + 9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51020419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 944797 + ... + 944850.
It is an arithmetic number, because the mean of its divisors is an integer number (9448240).
Almost surely, 251020469 is an apocalyptic number.
It is an amenable number.
51020469 is a deficient number, since it is larger than the sum of its proper divisors (24565451).
51020469 is a wasteful number, since it uses less digits than its factorization.
51020469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1889656 (or 1889650 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 51020469 is about 7142.8614014273. The cubic root of 51020469 is about 370.8925832638.
The spelling of 51020469 in words is "fifty-one million, twenty thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •