Base | Representation |
---|---|
bin | 1100001010100… |
… | …1111000000101 |
3 | 10120000110111222 |
4 | 3002221320011 |
5 | 101030334321 |
6 | 5021410125 |
7 | 1156504052 |
oct | 302517005 |
9 | 116013458 |
10 | 51027461 |
11 | 26892761 |
12 | 15109945 |
13 | a757c84 |
14 | 6ac4029 |
15 | 472e3ab |
hex | 30a9e05 |
51027461 has 2 divisors, whose sum is σ = 51027462. Its totient is φ = 51027460.
The previous prime is 51027433. The next prime is 51027469. The reversal of 51027461 is 16472015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 40883236 + 10144225 = 6394^2 + 3185^2 .
It is a cyclic number.
It is not a de Polignac number, because 51027461 - 26 = 51027397 is a prime.
It is a super-2 number, since 2×510274612 = 5207603552213042, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51027461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51027469) 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, 25513730 + 25513731.
It is an arithmetic number, because the mean of its divisors is an integer number (25513731).
Almost surely, 251027461 is an apocalyptic number.
It is an amenable number.
51027461 is a deficient number, since it is larger than the sum of its proper divisors (1).
51027461 is an equidigital number, since it uses as much as digits as its factorization.
51027461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 51027461 is about 7143.3508243681. The cubic root of 51027461 is about 370.9095252385.
Adding to 51027461 its reverse (16472015), we get a palindrome (67499476).
The spelling of 51027461 in words is "fifty-one million, twenty-seven thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •