Base | Representation |
---|---|
bin | 1111101010100… |
… | …00101010111111 |
3 | 100011020221020201 |
4 | 13311100222333 |
5 | 232114334211 |
6 | 21012224331 |
7 | 3153621316 |
oct | 765205277 |
9 | 304227221 |
10 | 131402431 |
11 | 6819a656 |
12 | 3800b0a7 |
13 | 212b9c24 |
14 | 1364727d |
15 | b8090c1 |
hex | 7d50abf |
131402431 has 2 divisors, whose sum is σ = 131402432. Its totient is φ = 131402430.
The previous prime is 131402419. The next prime is 131402437. The reversal of 131402431 is 134204131.
It is a strong prime.
It is an emirp because it is prime and its reverse (134204131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131402431 - 217 = 131271359 is a prime.
It is a super-2 number, since 2×1314024312 = 34533197745419522, 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 = 131402399 and 131402408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131402437) 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, 65701215 + 65701216.
It is an arithmetic number, because the mean of its divisors is an integer number (65701216).
Almost surely, 2131402431 is an apocalyptic number.
131402431 is a deficient number, since it is larger than the sum of its proper divisors (1).
131402431 is an equidigital number, since it uses as much as digits as its factorization.
131402431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 131402431 is about 11463.0899411982. The cubic root of 131402431 is about 508.3948392000.
Adding to 131402431 its reverse (134204131), we get a palindrome (265606562).
The spelling of 131402431 in words is "one hundred thirty-one million, four hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •