Base | Representation |
---|---|
bin | 1010000101100… |
… | …1111100000111 |
3 | 2221121122101001 |
4 | 2201121330013 |
5 | 41312431211 |
6 | 4110514131 |
7 | 1022432641 |
oct | 241317407 |
9 | 87548331 |
10 | 42311431 |
11 | 2197a228 |
12 | 12205947 |
13 | 89c5966 |
14 | 5895891 |
15 | 3aabac1 |
hex | 2859f07 |
42311431 has 2 divisors, whose sum is σ = 42311432. Its totient is φ = 42311430.
The previous prime is 42311417. The next prime is 42311443. The reversal of 42311431 is 13411324.
42311431 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 not a de Polignac number, because 42311431 - 219 = 41787143 is a prime.
It is a super-2 number, since 2×423114312 = 3580514386535522, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 42311399 and 42311408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42311411) 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, 21155715 + 21155716.
It is an arithmetic number, because the mean of its divisors is an integer number (21155716).
Almost surely, 242311431 is an apocalyptic number.
42311431 is a deficient number, since it is larger than the sum of its proper divisors (1).
42311431 is an equidigital number, since it uses as much as digits as its factorization.
42311431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 288, while the sum is 19.
The square root of 42311431 is about 6504.7237450948. The cubic root of 42311431 is about 348.4597103058.
Adding to 42311431 its reverse (13411324), we get a palindrome (55722755).
The spelling of 42311431 in words is "forty-two million, three hundred eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •