Base | Representation |
---|---|
bin | 1010000001011… |
… | …1111001100011 |
3 | 2221002220022112 |
4 | 2200113321203 |
5 | 41230302211 |
6 | 4101025535 |
7 | 1020225212 |
oct | 240277143 |
9 | 87086275 |
10 | 42040931 |
11 | 21804a79 |
12 | 120b52ab |
13 | 892c7ba |
14 | 5825079 |
15 | 3a5688b |
hex | 2817e63 |
42040931 has 2 divisors, whose sum is σ = 42040932. Its totient is φ = 42040930.
The previous prime is 42040927. The next prime is 42040961. The reversal of 42040931 is 13904024.
42040931 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 42040931 - 22 = 42040927 is a prime.
It is a super-2 number, since 2×420409312 = 3534879758693522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 42040897 and 42040906.
It is not a weakly prime, because it can be changed into another prime (42040961) 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, 21020465 + 21020466.
It is an arithmetic number, because the mean of its divisors is an integer number (21020466).
Almost surely, 242040931 is an apocalyptic number.
42040931 is a deficient number, since it is larger than the sum of its proper divisors (1).
42040931 is an equidigital number, since it uses as much as digits as its factorization.
42040931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 42040931 is about 6483.8978246114. The cubic root of 42040931 is about 347.7155462767.
Adding to 42040931 its reverse (13904024), we get a palindrome (55944955).
The spelling of 42040931 in words is "forty-two million, forty thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •