Base | Representation |
---|---|
bin | 1010010111000… |
… | …01001010101000 |
3 | 20001112020221200 |
4 | 11023201022220 |
5 | 134221434022 |
6 | 12342404200 |
7 | 2103453561 |
oct | 513411250 |
9 | 201466850 |
10 | 86905512 |
11 | 45068441 |
12 | 25130660 |
13 | 1500a5a5 |
14 | b783168 |
15 | 7969bac |
hex | 52e12a8 |
86905512 has 48 divisors (see below), whose sum is σ = 236763540. Its totient is φ = 28796928.
The previous prime is 86905463. The next prime is 86905519. The reversal of 86905512 is 21550968.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 86378436 + 527076 = 9294^2 + 726^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (86905519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8968 + ... + 15944.
Almost surely, 286905512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 86905512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118381770).
86905512 is an abundant number, since it is smaller than the sum of its proper divisors (149858028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86905512 is a wasteful number, since it uses less digits than its factorization.
86905512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7162 (or 7155 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The square root of 86905512 is about 9322.3125886231. The cubic root of 86905512 is about 442.9442899505.
The spelling of 86905512 in words is "eighty-six million, nine hundred five thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •