Base | Representation |
---|---|
bin | 1010100100111011… |
… | …00110000000000000 |
3 | 112122202000111101000 |
4 | 11102131212000000 |
5 | 43112141104312 |
6 | 2335245012000 |
7 | 260501041506 |
oct | 52235460000 |
9 | 15582014330 |
10 | 5678456832 |
11 | 2454382734 |
12 | 1125854000 |
13 | 6c6597339 |
14 | 3bc22c676 |
15 | 2337c0adc |
hex | 152766000 |
5678456832 has 112 divisors (see below), whose sum is σ = 16824685680. Its totient is φ = 1892745216.
The previous prime is 5678456801. The next prime is 5678456851. The reversal of 5678456832 is 2386548765.
5678456832 is a `hidden beast` number, since 5 + 6 + 78 + 4 + 568 + 3 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
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, 208348 + ... + 234020.
Almost surely, 25678456832 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 5678456832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8412342840).
5678456832 is an abundant number, since it is smaller than the sum of its proper divisors (11146228848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5678456832 is an equidigital number, since it uses as much as digits as its factorization.
5678456832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25708 (or 25678 counting only the distinct ones).
The product of its digits is 9676800, while the sum is 54.
The square root of 5678456832 is about 75355.5361735288. The cubic root of 5678456832 is about 1784.0626842245.
The spelling of 5678456832 in words is "five billion, six hundred seventy-eight million, four hundred fifty-six thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •