Base | Representation |
---|---|
bin | 1010100011010011… |
… | …01111011011010000 |
3 | 112121210102220110000 |
4 | 11101221233123100 |
5 | 43100201121302 |
6 | 2334041410000 |
7 | 260244356226 |
oct | 52151573320 |
9 | 15553386400 |
10 | 5664863952 |
11 | 2447739150 |
12 | 1121199900 |
13 | 6c3818307 |
14 | 3ba4d0b16 |
15 | 2324d831c |
hex | 151a6f6d0 |
5664863952 has 200 divisors, whose sum is σ = 18007320672. Its totient is φ = 1705017600.
The previous prime is 5664863917. The next prime is 5664863977. The reversal of 5664863952 is 2593684665.
5664863952 is a `hidden beast` number, since 566 + 48 + 6 + 39 + 5 + 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 (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2236927 + ... + 2239457.
Almost surely, 25664863952 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 5664863952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9003660336).
5664863952 is an abundant number, since it is smaller than the sum of its proper divisors (12342456720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5664863952 is a wasteful number, since it uses less digits than its factorization.
5664863952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2719 (or 2704 counting only the distinct ones).
The product of its digits is 9331200, while the sum is 54.
The square root of 5664863952 is about 75265.2904863856. The cubic root of 5664863952 is about 1782.6380057427.
The spelling of 5664863952 in words is "five billion, six hundred sixty-four million, eight hundred sixty-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •