Base | Representation |
---|---|
bin | 10011101001100100110111 |
3 | 100200200212221 |
4 | 103221210313 |
5 | 2304313111 |
6 | 302223211 |
7 | 61532404 |
oct | 23514467 |
9 | 10620787 |
10 | 5151031 |
11 | 29a9056 |
12 | 1884b07 |
13 | 10b4762 |
14 | 9812ab |
15 | 6bb371 |
hex | 4e9937 |
5151031 has 2 divisors, whose sum is σ = 5151032. Its totient is φ = 5151030.
The previous prime is 5151019. The next prime is 5151043. The reversal of 5151031 is 1301515.
It is a balanced prime because it is at equal distance from previous prime (5151019) and next prime (5151043).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5151031 is a prime.
It is a super-2 number, since 2×51510312 = 53066240725922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5150996 and 5151014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5151001) 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, 2575515 + 2575516.
It is an arithmetic number, because the mean of its divisors is an integer number (2575516).
Almost surely, 25151031 is an apocalyptic number.
5151031 is a deficient number, since it is larger than the sum of its proper divisors (1).
5151031 is an equidigital number, since it uses as much as digits as its factorization.
5151031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75, while the sum is 16.
The square root of 5151031 is about 2269.5882886550. The cubic root of 5151031 is about 172.7022733987.
Adding to 5151031 its reverse (1301515), we get a palindrome (6452546).
It can be divided in two parts, 515 and 1031, that multiplied together give a triangular number (530965 = T1030).
The spelling of 5151031 in words is "five million, one hundred fifty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •