Base | Representation |
---|---|
bin | 1100110011001010… |
… | …10011110000000000 |
3 | 122201220020120120000 |
4 | 12121211103300000 |
5 | 103033121132233 |
6 | 3053511320000 |
7 | 332200105512 |
oct | 63145236000 |
9 | 18656216500 |
10 | 6871661568 |
11 | 2a06968052 |
12 | 13b9380000 |
13 | 85684c845 |
14 | 4928adbb2 |
15 | 2a3417d13 |
hex | 199953c00 |
6871661568 has 110 divisors (see below), whose sum is σ = 20520372576. Its totient is φ = 2290526208.
The previous prime is 6871661521. The next prime is 6871661591. The reversal of 6871661568 is 8651661786.
6871661568 is a `hidden beast` number, since 6 + 8 + 7 + 16 + 61 + 568 = 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 (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 41521 + ... + 124367.
Almost surely, 26871661568 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 6871661568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10260186288).
6871661568 is an abundant number, since it is smaller than the sum of its proper divisors (13648711008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6871661568 is an equidigital number, since it uses as much as digits as its factorization.
6871661568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82879 (or 82852 counting only the distinct ones).
The product of its digits is 2903040, while the sum is 54.
The square root of 6871661568 is about 82895.4858119548. The cubic root of 6871661568 is about 1901.1684011990.
The spelling of 6871661568 in words is "six billion, eight hundred seventy-one million, six hundred sixty-one thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •