Base | Representation |
---|---|
bin | 11101110011110… |
… | …000001100101111 |
3 | 1021212001000111121 |
4 | 131303300030233 |
5 | 2011011343111 |
6 | 121343001411 |
7 | 15251555035 |
oct | 3563601457 |
9 | 1255030447 |
10 | 500106031 |
11 | 23732a077 |
12 | 11b599267 |
13 | 7c7c1439 |
14 | 4a5c2555 |
15 | 2dd89871 |
hex | 1dcf032f |
500106031 has 2 divisors, whose sum is σ = 500106032. Its totient is φ = 500106030.
The previous prime is 500105989. The next prime is 500106067. The reversal of 500106031 is 130601005.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 500106031 - 213 = 500097839 is a prime.
It is a super-2 number, since 2×5001060312 = 500212084485145922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 500105996 and 500106014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (500100031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250053015 + 250053016.
It is an arithmetic number, because the mean of its divisors is an integer number (250053016).
Almost surely, 2500106031 is an apocalyptic number.
500106031 is a deficient number, since it is larger than the sum of its proper divisors (1).
500106031 is an equidigital number, since it uses as much as digits as its factorization.
500106031 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 500106031 is about 22363.0505745527. The cubic root of 500106031 is about 793.7566265923.
Adding to 500106031 its reverse (130601005), we get a palindrome (630707036).
The spelling of 500106031 in words is "five hundred million, one hundred six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •