Base | Representation |
---|---|
bin | 10011010011100110100111 |
3 | 100112010102121 |
4 | 103103212213 |
5 | 2243423111 |
6 | 300250411 |
7 | 61006123 |
oct | 23234647 |
9 | 10463377 |
10 | 5061031 |
11 | 2947478 |
12 | 1840a07 |
13 | 10827c1 |
14 | 95a583 |
15 | 69e871 |
hex | 4d39a7 |
5061031 has 2 divisors, whose sum is σ = 5061032. Its totient is φ = 5061030.
The previous prime is 5061013. The next prime is 5061047. The reversal of 5061031 is 1301605.
Together with previous prime (5061013) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (5061047) can be obtained adding 5061031 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5061031 is a prime.
It is a super-2 number, since 2×50610312 = 51228069565922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5060996 and 5061014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5061061) 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, 2530515 + 2530516.
It is an arithmetic number, because the mean of its divisors is an integer number (2530516).
Almost surely, 25061031 is an apocalyptic number.
5061031 is a deficient number, since it is larger than the sum of its proper divisors (1).
5061031 is an equidigital number, since it uses as much as digits as its factorization.
5061031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 5061031 is about 2249.6735318708. The cubic root of 5061031 is about 171.6905265272.
Adding to 5061031 its reverse (1301605), we get a palindrome (6362636).
The spelling of 5061031 in words is "five million, sixty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •