Base | Representation |
---|---|
bin | 1100001100001… |
… | …1000011110001 |
3 | 10120012201000021 |
4 | 3003003003301 |
5 | 101042134414 |
6 | 5023523441 |
7 | 1160413555 |
oct | 303030361 |
9 | 116181007 |
10 | 51130609 |
11 | 26953202 |
12 | 15159581 |
13 | a792bca |
14 | 6b0d865 |
15 | 474ec24 |
hex | 30c30f1 |
51130609 has 2 divisors, whose sum is σ = 51130610. Its totient is φ = 51130608.
The previous prime is 51130591. The next prime is 51130613. The reversal of 51130609 is 90603115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43824400 + 7306209 = 6620^2 + 2703^2 .
It is a cyclic number.
It is not a de Polignac number, because 51130609 - 27 = 51130481 is a prime.
It is a super-2 number, since 2×511306092 = 5228678353421762, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51130309) 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 as a sum of consecutive naturals, namely, 25565304 + 25565305.
It is an arithmetic number, because the mean of its divisors is an integer number (25565305).
Almost surely, 251130609 is an apocalyptic number.
It is an amenable number.
51130609 is a deficient number, since it is larger than the sum of its proper divisors (1).
51130609 is an equidigital number, since it uses as much as digits as its factorization.
51130609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 25.
The square root of 51130609 is about 7150.5670404521. The cubic root of 51130609 is about 371.1592785085.
The spelling of 51130609 in words is "fifty-one million, one hundred thirty thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •