Base | Representation |
---|---|
bin | 111110001000100… |
… | …001000100111111 |
3 | 2200122111102110022 |
4 | 332020201010333 |
5 | 4113324420111 |
6 | 251234402355 |
7 | 34555265312 |
oct | 7610410477 |
9 | 2618442408 |
10 | 1042420031 |
11 | 495467664 |
12 | 2511303bb |
13 | 137c703b3 |
14 | 9c630979 |
15 | 617b02db |
hex | 3e22113f |
1042420031 has 2 divisors, whose sum is σ = 1042420032. Its totient is φ = 1042420030.
The previous prime is 1042419913. The next prime is 1042420081. The reversal of 1042420031 is 1300242401.
1042420031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1042420031 is a prime.
It is a super-2 number, since 2×10424200312 = 2173279042060081922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1042419991 and 1042420009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1042420081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521210015 + 521210016.
It is an arithmetic number, because the mean of its divisors is an integer number (521210016).
Almost surely, 21042420031 is an apocalyptic number.
1042420031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042420031 is an equidigital number, since it uses as much as digits as its factorization.
1042420031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 1042420031 is about 32286.5301790081. The cubic root of 1042420031 is about 1013.9446531212.
Adding to 1042420031 its reverse (1300242401), we get a palindrome (2342662432).
The spelling of 1042420031 in words is "one billion, forty-two million, four hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •