Base | Representation |
---|---|
bin | 1010010101001… |
… | …11111101100000 |
3 | 20001002100112110 |
4 | 11022213331200 |
5 | 134141434300 |
6 | 12333355320 |
7 | 2101456500 |
oct | 512477540 |
9 | 201070473 |
10 | 86671200 |
11 | 44a183a0 |
12 | 25038b40 |
13 | 14c57a45 |
14 | b721a00 |
15 | 7920550 |
hex | 52a7f60 |
86671200 has 432 divisors, whose sum is σ = 363351744. Its totient is φ = 17740800.
The previous prime is 86671183. The next prime is 86671213. The reversal of 86671200 is 217668.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1293567 + ... + 1293633.
It is an arithmetic number, because the mean of its divisors is an integer number (841092).
Almost surely, 286671200 is an apocalyptic number.
86671200 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 86671200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181675872).
86671200 is an abundant number, since it is smaller than the sum of its proper divisors (276680544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86671200 is a wasteful number, since it uses less digits than its factorization.
86671200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115 (or 95 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 86671200 is about 9309.7368383859. The cubic root of 86671200 is about 442.5458473355.
Adding to 86671200 its reverse (217668), we get a palindrome (86888868).
The spelling of 86671200 in words is "eighty-six million, six hundred seventy-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •