Base | Representation |
---|---|
bin | 1100001010101… |
… | …0101001111001 |
3 | 10120000121220001 |
4 | 3002222221321 |
5 | 101030440044 |
6 | 5021433001 |
7 | 1156516255 |
oct | 302525171 |
9 | 116017801 |
10 | 51030649 |
11 | 2689509a |
12 | 1510b761 |
13 | a759567 |
14 | 6ac5265 |
15 | 47302d4 |
hex | 30aaa79 |
51030649 has 2 divisors, whose sum is σ = 51030650. Its totient is φ = 51030648.
The previous prime is 51030647. The next prime is 51030671. The reversal of 51030649 is 94603015.
51030649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 47169424 + 3861225 = 6868^2 + 1965^2 .
It is a cyclic number.
It is not a de Polignac number, because 51030649 - 21 = 51030647 is a prime.
It is a super-2 number, since 2×510306492 = 5208254274722402, which contains 22 as substring.
Together with 51030647, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (51030643) 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 as a sum of consecutive naturals, namely, 25515324 + 25515325.
It is an arithmetic number, because the mean of its divisors is an integer number (25515325).
Almost surely, 251030649 is an apocalyptic number.
It is an amenable number.
51030649 is a deficient number, since it is larger than the sum of its proper divisors (1).
51030649 is an equidigital number, since it uses as much as digits as its factorization.
51030649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 51030649 is about 7143.5739654601. The cubic root of 51030649 is about 370.9172494124.
The spelling of 51030649 in words is "fifty-one million, thirty thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •