Base | Representation |
---|---|
bin | 1010010011111… |
… | …01100001001001 |
3 | 20000202112001200 |
4 | 11021331201021 |
5 | 134120403403 |
6 | 12325534413 |
7 | 2100133605 |
oct | 511754111 |
9 | 200675050 |
10 | 86497353 |
11 | 44909818 |
12 | 24b74409 |
13 | 14bc6887 |
14 | b6b8505 |
15 | 78d8ca3 |
hex | 527d849 |
86497353 has 12 divisors (see below), whose sum is σ = 125068788. Its totient is φ = 57605760.
The previous prime is 86497351. The next prime is 86497387. The reversal of 86497353 is 35379468.
It can be written as a sum of positive squares in 2 ways, for example, as 14722569 + 71774784 = 3837^2 + 8472^2 .
It is not a de Polignac number, because 86497353 - 21 = 86497351 is a prime.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 86497299 and 86497308.
It is not an unprimeable number, because it can be changed into a prime (86497351) 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 11 ways as a sum of consecutive naturals, for example, 5493 + ... + 14253.
It is an arithmetic number, because the mean of its divisors is an integer number (10422399).
Almost surely, 286497353 is an apocalyptic number.
It is an amenable number.
86497353 is a deficient number, since it is larger than the sum of its proper divisors (38571435).
86497353 is a wasteful number, since it uses less digits than its factorization.
86497353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9864 (or 9861 counting only the distinct ones).
The product of its digits is 544320, while the sum is 45.
The square root of 86497353 is about 9300.3953141789. The cubic root of 86497353 is about 442.2497598816.
The spelling of 86497353 in words is "eighty-six million, four hundred ninety-seven thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •