Base | Representation |
---|---|
bin | 1010010000001… |
… | …11001000001111 |
3 | 12222211212212121 |
4 | 11020013020033 |
5 | 134004344211 |
6 | 12311313411 |
7 | 2063044051 |
oct | 510071017 |
9 | 188755777 |
10 | 86012431 |
11 | 4460845a |
12 | 2497b867 |
13 | 14a86c3b |
14 | b5cd8d1 |
15 | 7840271 |
hex | 520720f |
86012431 has 2 divisors, whose sum is σ = 86012432. Its totient is φ = 86012430.
The previous prime is 86012413. The next prime is 86012441. The reversal of 86012431 is 13421068.
Together with previous prime (86012413) 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 not a de Polignac number, because 86012431 - 211 = 86010383 is a prime.
It is a super-2 number, since 2×860124312 = 14796276573059522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 86012396 and 86012405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (86012441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 43006215 + 43006216.
It is an arithmetic number, because the mean of its divisors is an integer number (43006216).
Almost surely, 286012431 is an apocalyptic number.
86012431 is a deficient number, since it is larger than the sum of its proper divisors (1).
86012431 is an equidigital number, since it uses as much as digits as its factorization.
86012431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 86012431 is about 9274.2887058793. The cubic root of 86012431 is about 441.4217628536.
Adding to 86012431 its reverse (13421068), we get a palindrome (99433499).
The spelling of 86012431 in words is "eighty-six million, twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •