Base | Representation |
---|---|
bin | 1010010000111… |
… | …01100010100111 |
3 | 20000000112210121 |
4 | 11020131202213 |
5 | 134020313411 |
6 | 12313302411 |
7 | 2063605513 |
oct | 510354247 |
9 | 200015717 |
10 | 86104231 |
11 | 44670424 |
12 | 24a04a07 |
13 | 14ab9965 |
14 | b615143 |
15 | 785c571 |
hex | 521d8a7 |
86104231 has 4 divisors (see below), whose sum is σ = 86200072. Its totient is φ = 86008392.
The previous prime is 86104211. The next prime is 86104237. The reversal of 86104231 is 13240168.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 86104231 - 25 = 86104199 is a prime.
It is a super-2 number, since 2×861042312 = 14827877192202722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 86104196 and 86104205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86104237) 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 in 3 ways as a sum of consecutive naturals, for example, 46560 + ... + 48373.
It is an arithmetic number, because the mean of its divisors is an integer number (21550018).
Almost surely, 286104231 is an apocalyptic number.
86104231 is a deficient number, since it is larger than the sum of its proper divisors (95841).
86104231 is an equidigital number, since it uses as much as digits as its factorization.
86104231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95840.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 86104231 is about 9279.2365526481. The cubic root of 86104231 is about 441.5787483401.
Adding to 86104231 its reverse (13240168), we get a palindrome (99344399).
The spelling of 86104231 in words is "eighty-six million, one hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •