Base | Representation |
---|---|
bin | 110011100000000… |
… | …100100111100000 |
3 | 2020012212001122112 |
4 | 303200010213200 |
5 | 3232143424121 |
6 | 221423254452 |
7 | 30261160124 |
oct | 6340044740 |
9 | 2205761575 |
10 | 864045536 |
11 | 403805222 |
12 | 20144a428 |
13 | 10a018363 |
14 | 82a7b584 |
15 | 50cc875b |
hex | 338049e0 |
864045536 has 48 divisors (see below), whose sum is σ = 1809346896. Its totient is φ = 404760576.
The previous prime is 864045503. The next prime is 864045557. The reversal of 864045536 is 635540468.
It is a junction number, because it is equal to n+sod(n) for n = 864045493 and 864045502.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 119990 + ... + 126986.
It is an arithmetic number, because the mean of its divisors is an integer number (37694727).
Almost surely, 2864045536 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 864045536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (904673448).
864045536 is an abundant number, since it is smaller than the sum of its proper divisors (945301360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
864045536 is a wasteful number, since it uses less digits than its factorization.
864045536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7251 (or 7243 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 41.
The square root of 864045536 is about 29394.6514862823. The cubic root of 864045536 is about 952.4573632699.
The spelling of 864045536 in words is "eight hundred sixty-four million, forty-five thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •