Base | Representation |
---|---|
bin | 1100010001110… |
… | …1000001100101 |
3 | 10120220102111102 |
4 | 3010131001211 |
5 | 101140432414 |
6 | 5035445445 |
7 | 1163510114 |
oct | 304350145 |
9 | 116812442 |
10 | 51499109 |
11 | 27085052 |
12 | 152b6885 |
13 | a89185c |
14 | 6ba7c7b |
15 | 47c3ede |
hex | 311d065 |
51499109 has 2 divisors, whose sum is σ = 51499110. Its totient is φ = 51499108.
The previous prime is 51499087. The next prime is 51499111. The reversal of 51499109 is 90199415.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34869025 + 16630084 = 5905^2 + 4078^2 .
It is a cyclic number.
It is not a de Polignac number, because 51499109 - 212 = 51495013 is a prime.
It is a Sophie Germain prime.
Together with 51499111, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51499309) 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, 25749554 + 25749555.
It is an arithmetic number, because the mean of its divisors is an integer number (25749555).
Almost surely, 251499109 is an apocalyptic number.
It is an amenable number.
51499109 is a deficient number, since it is larger than the sum of its proper divisors (1).
51499109 is an equidigital number, since it uses as much as digits as its factorization.
51499109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 38.
The square root of 51499109 is about 7176.2879680236. The cubic root of 51499109 is about 372.0487974103.
The spelling of 51499109 in words is "fifty-one million, four hundred ninety-nine thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •