Base | Representation |
---|---|
bin | 11101110100111… |
… | …101001100110111 |
3 | 1021212122001011002 |
4 | 131310331030313 |
5 | 2011101441211 |
6 | 121353433515 |
7 | 15254340416 |
oct | 3564751467 |
9 | 1255561132 |
10 | 500421431 |
11 | 237525034 |
12 | 11b70b89b |
13 | 7c8a1b73 |
14 | 4a66547d |
15 | 2dded03b |
hex | 1dd3d337 |
500421431 has 2 divisors, whose sum is σ = 500421432. Its totient is φ = 500421430.
The previous prime is 500421413. The next prime is 500421443. The reversal of 500421431 is 134124005.
Together with previous prime (500421413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-500421431 is a prime.
It is a super-2 number, since 2×5004214312 = 500843217208175522, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (500421331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250210715 + 250210716.
It is an arithmetic number, because the mean of its divisors is an integer number (250210716).
Almost surely, 2500421431 is an apocalyptic number.
500421431 is a deficient number, since it is larger than the sum of its proper divisors (1).
500421431 is an equidigital number, since it uses as much as digits as its factorization.
500421431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 500421431 is about 22370.1012737985. The cubic root of 500421431 is about 793.9234567001.
Adding to 500421431 its reverse (134124005), we get a palindrome (634545436).
The spelling of 500421431 in words is "five hundred million, four hundred twenty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •