Base | Representation |
---|---|
bin | 1100001110001… |
… | …0001100010011 |
3 | 10120110011221022 |
4 | 3003202030103 |
5 | 101110230011 |
6 | 5030350055 |
7 | 1161454421 |
oct | 303421423 |
9 | 116404838 |
10 | 51258131 |
11 | 26a2aaa1 |
12 | 151bb32b |
13 | a808c72 |
14 | 6b44111 |
15 | 47778db |
hex | 30e2313 |
51258131 has 2 divisors, whose sum is σ = 51258132. Its totient is φ = 51258130.
The previous prime is 51258113. The next prime is 51258133. The reversal of 51258131 is 13185215.
It is a happy number.
Together with previous prime (51258113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51258131 - 222 = 47063827 is a prime.
It is a super-2 number, since 2×512581312 = 5254791987226322, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 51258133, it forms a pair of twin primes.
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 51258131.
It is not a weakly prime, because it can be changed into another prime (51258133) 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, 25629065 + 25629066.
It is an arithmetic number, because the mean of its divisors is an integer number (25629066).
Almost surely, 251258131 is an apocalyptic number.
51258131 is a deficient number, since it is larger than the sum of its proper divisors (1).
51258131 is an equidigital number, since it uses as much as digits as its factorization.
51258131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1200, while the sum is 26.
The square root of 51258131 is about 7159.4784027889. The cubic root of 51258131 is about 371.4675848919.
The spelling of 51258131 in words is "fifty-one million, two hundred fifty-eight thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •