Base | Representation |
---|---|
bin | 1100001011000… |
… | …1111011001001 |
3 | 10120002010201212 |
4 | 3002301323021 |
5 | 101032413200 |
6 | 5022222505 |
7 | 1160002133 |
oct | 302617311 |
9 | 116063655 |
10 | 51060425 |
11 | 269054a9 |
12 | 15124a35 |
13 | a769c90 |
14 | 6ad2053 |
15 | 4739035 |
hex | 30b1ec9 |
51060425 has 12 divisors (see below), whose sum is σ = 68185740. Its totient is φ = 37705920.
The previous prime is 51060421. The next prime is 51060439. The reversal of 51060425 is 52406015.
51060425 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 17106496 + 33953929 = 4136^2 + 5827^2 .
It is not a de Polignac number, because 51060425 - 22 = 51060421 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51060425.
It is not an unprimeable number, because it can be changed into a prime (51060421) 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 11 ways as a sum of consecutive naturals, for example, 78230 + ... + 78879.
It is an arithmetic number, because the mean of its divisors is an integer number (5682145).
Almost surely, 251060425 is an apocalyptic number.
It is an amenable number.
51060425 is a deficient number, since it is larger than the sum of its proper divisors (17125315).
51060425 is a wasteful number, since it uses less digits than its factorization.
51060425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157132 (or 157127 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 51060425 is about 7145.6577723818. The cubic root of 51060425 is about 370.9893778608.
The spelling of 51060425 in words is "fifty-one million, sixty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •