Base | Representation |
---|---|
bin | 1010010000101… |
… | …11011111100000 |
3 | 12222222021211000 |
4 | 11020113133200 |
5 | 134014020311 |
6 | 12312552000 |
7 | 2063443341 |
oct | 510273740 |
9 | 188867730 |
10 | 86079456 |
11 | 44653851 |
12 | 249b2600 |
13 | 14aab5b8 |
14 | b60a0c8 |
15 | 7855056 |
hex | 52177e0 |
86079456 has 96 divisors (see below), whose sum is σ = 254983680. Its totient is φ = 28245888.
The previous prime is 86079451. The next prime is 86079463. The reversal of 86079456 is 65497068.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86079451) 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 15 ways as a sum of consecutive naturals, for example, 57145 + ... + 58631.
It is an arithmetic number, because the mean of its divisors is an integer number (2656080).
Almost surely, 286079456 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 86079456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127491840).
86079456 is an abundant number, since it is smaller than the sum of its proper divisors (168904224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86079456 is a wasteful number, since it uses less digits than its factorization.
86079456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1573 (or 1559 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The square root of 86079456 is about 9277.9014868665. The cubic root of 86079456 is about 441.5363920671.
The spelling of 86079456 in words is "eighty-six million, seventy-nine thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •