Base | Representation |
---|---|
bin | 1100001011111… |
… | …0000001101101 |
3 | 10120011122201212 |
4 | 3002332001231 |
5 | 101041004442 |
6 | 5023244205 |
7 | 1160266511 |
oct | 302760155 |
9 | 116148655 |
10 | 51109997 |
11 | 26939774 |
12 | 15149665 |
13 | a786703 |
14 | 6b06141 |
15 | 4748a82 |
hex | 30be06d |
51109997 has 2 divisors, whose sum is σ = 51109998. Its totient is φ = 51109996.
The previous prime is 51109969. The next prime is 51110011. The reversal of 51109997 is 79990115.
It is a happy number.
51109997 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43414921 + 7695076 = 6589^2 + 2774^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51109997 is a prime.
It is a super-2 number, since 2×511099972 = 5224463586680018, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51109907) 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, 25554998 + 25554999.
It is an arithmetic number, because the mean of its divisors is an integer number (25554999).
Almost surely, 251109997 is an apocalyptic number.
It is an amenable number.
51109997 is a deficient number, since it is larger than the sum of its proper divisors (1).
51109997 is an equidigital number, since it uses as much as digits as its factorization.
51109997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25515, while the sum is 41.
The square root of 51109997 is about 7149.1256108702. The cubic root of 51109997 is about 371.1093973418.
The spelling of 51109997 in words is "fifty-one million, one hundred nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •