Base | Representation |
---|---|
bin | 110011110010101… |
… | …010010011110000 |
3 | 2020120000122010010 |
4 | 303302222103300 |
5 | 3234420343022 |
6 | 222115534520 |
7 | 30350454060 |
oct | 6362522360 |
9 | 2216018103 |
10 | 868918512 |
11 | 406533380 |
12 | 202bba440 |
13 | 10b033387 |
14 | 835893a0 |
15 | 5143c50c |
hex | 33caa4f0 |
868918512 has 160 divisors (see below), whose sum is σ = 2813391360. Its totient is φ = 224501760.
The previous prime is 868918493. The next prime is 868918537. The reversal of 868918512 is 215819868.
868918512 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 860664 + ... + 861672.
It is an arithmetic number, because the mean of its divisors is an integer number (17583696).
Almost surely, 2868918512 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 868918512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1406695680).
868918512 is an abundant number, since it is smaller than the sum of its proper divisors (1944472848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
868918512 is a wasteful number, since it uses less digits than its factorization.
868918512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1271 (or 1265 counting only the distinct ones).
The product of its digits is 276480, while the sum is 48.
The square root of 868918512 is about 29477.4237680297. The cubic root of 868918512 is about 954.2445390989.
The spelling of 868918512 in words is "eight hundred sixty-eight million, nine hundred eighteen thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •