Base | Representation |
---|---|
bin | 1010010010011… |
… | …01000110101101 |
3 | 20000101110001020 |
4 | 11021031012231 |
5 | 134043032203 |
6 | 12321404353 |
7 | 2065346511 |
oct | 511150655 |
9 | 200343036 |
10 | 86299053 |
11 | 44793835 |
12 | 24a996b9 |
13 | 14b57539 |
14 | b666141 |
15 | 789a153 |
hex | 524d1ad |
86299053 has 8 divisors (see below), whose sum is σ = 115173600. Its totient is φ = 57478608.
The previous prime is 86299051. The next prime is 86299061. The reversal of 86299053 is 35099268.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 86299053 - 21 = 86299051 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 86298996 and 86299014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86299051) 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 7 ways as a sum of consecutive naturals, for example, 9643 + ... + 16296.
It is an arithmetic number, because the mean of its divisors is an integer number (14396700).
Almost surely, 286299053 is an apocalyptic number.
It is an amenable number.
86299053 is a deficient number, since it is larger than the sum of its proper divisors (28874547).
86299053 is a wasteful number, since it uses less digits than its factorization.
86299053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27051.
The product of its (nonzero) digits is 116640, while the sum is 42.
The square root of 86299053 is about 9289.7283598607. The cubic root of 86299053 is about 441.9115405510.
The spelling of 86299053 in words is "eighty-six million, two hundred ninety-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •