Base | Representation |
---|---|
bin | 1010010110100… |
… | …11111101110000 |
3 | 20001102111210000 |
4 | 11023103331300 |
5 | 134213221230 |
6 | 12341310000 |
7 | 2103140124 |
oct | 513237560 |
9 | 201374700 |
10 | 86851440 |
11 | 45030855 |
12 | 25105300 |
13 | 14cbbab0 |
14 | b76b584 |
15 | 7958b60 |
hex | 52d3f70 |
86851440 has 200 divisors, whose sum is σ = 325166688. Its totient is φ = 21358080.
The previous prime is 86851423. The next prime is 86851447. The reversal of 86851440 is 4415868.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 86851395 and 86851404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86851447) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 83725 + ... + 84755.
Almost surely, 286851440 is an apocalyptic number.
86851440 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 86851440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162583344).
86851440 is an abundant number, since it is smaller than the sum of its proper divisors (238315248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86851440 is a wasteful number, since it uses less digits than its factorization.
86851440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1069 (or 1054 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 36.
The square root of 86851440 is about 9319.4119986188. The cubic root of 86851440 is about 442.8524052811.
The spelling of 86851440 in words is "eighty-six million, eight hundred fifty-one thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •