Base | Representation |
---|---|
bin | 1100001101010… |
… | …0010001011001 |
3 | 10120100021201112 |
4 | 3003110101121 |
5 | 101101413423 |
6 | 5025230105 |
7 | 1161126245 |
oct | 303242131 |
9 | 116307645 |
10 | 51201113 |
11 | 269a1177 |
12 | 15192335 |
13 | a7b9022 |
14 | 6b2b425 |
15 | 4765a78 |
hex | 30d4459 |
51201113 has 2 divisors, whose sum is σ = 51201114. Its totient is φ = 51201112.
The previous prime is 51201107. The next prime is 51201131. The reversal of 51201113 is 31110215.
Together with next prime (51201131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 47844889 + 3356224 = 6917^2 + 1832^2 .
It is a cyclic number.
It is not a de Polignac number, because 51201113 - 210 = 51200089 is a prime.
It is not a weakly prime, because it can be changed into another prime (51201133) 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, 25600556 + 25600557.
It is an arithmetic number, because the mean of its divisors is an integer number (25600557).
Almost surely, 251201113 is an apocalyptic number.
It is an amenable number.
51201113 is a deficient number, since it is larger than the sum of its proper divisors (1).
51201113 is an equidigital number, since it uses as much as digits as its factorization.
51201113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30, while the sum is 14.
The square root of 51201113 is about 7155.4953008160. The cubic root of 51201113 is about 371.3297973406.
Adding to 51201113 its reverse (31110215), we get a palindrome (82311328).
The spelling of 51201113 in words is "fifty-one million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •