Base | Representation |
---|---|
bin | 1100010000101… |
… | …1000011101001 |
3 | 10120202200112122 |
4 | 3010023003221 |
5 | 101131104023 |
6 | 5034121025 |
7 | 1163052416 |
oct | 304130351 |
9 | 116680478 |
10 | 51425513 |
11 | 27034827 |
12 | 15280175 |
13 | a8671c9 |
14 | 6b8910d |
15 | 47ac2c8 |
hex | 310b0e9 |
51425513 has 4 divisors (see below), whose sum is σ = 52149888. Its totient is φ = 50701140.
The previous prime is 51425489. The next prime is 51425551. The reversal of 51425513 is 31552415.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31552415 = 5 ⋅6310483.
It is a cyclic number.
It is not a de Polignac number, because 51425513 - 212 = 51421417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51427513) 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 3 ways as a sum of consecutive naturals, for example, 362081 + ... + 362222.
It is an arithmetic number, because the mean of its divisors is an integer number (13037472).
Almost surely, 251425513 is an apocalyptic number.
It is an amenable number.
51425513 is a deficient number, since it is larger than the sum of its proper divisors (724375).
51425513 is an equidigital number, since it uses as much as digits as its factorization.
51425513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 724374.
The product of its digits is 3000, while the sum is 26.
The square root of 51425513 is about 7171.1584140918. The cubic root of 51425513 is about 371.8714845889.
Adding to 51425513 its reverse (31552415), we get a palindrome (82977928).
The spelling of 51425513 in words is "fifty-one million, four hundred twenty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •