Base | Representation |
---|---|
bin | 1100110000110000… |
… | …00110110000100000 |
3 | 122200111011100211012 |
4 | 12120120012300200 |
5 | 103012431021024 |
6 | 3051505440052 |
7 | 331533064640 |
oct | 63030066040 |
9 | 18614140735 |
10 | 6851423264 |
11 | 29a64a4784 |
12 | 13b2640028 |
13 | 8525b4b0a |
14 | 48dd22520 |
15 | 2a176b50e |
hex | 198606c20 |
6851423264 has 96 divisors (see below), whose sum is σ = 16194318336. Its totient is φ = 2789740800.
The previous prime is 6851423263. The next prime is 6851423279. The reversal of 6851423264 is 4623241586.
It is not an unprimeable number, because it can be changed into a prime (6851423263) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 773549 + ... + 782355.
It is an arithmetic number, because the mean of its divisors is an integer number (168690816).
Almost surely, 26851423264 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 6851423264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8097159168).
6851423264 is an abundant number, since it is smaller than the sum of its proper divisors (9342895072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6851423264 is a wasteful number, since it uses less digits than its factorization.
6851423264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8998 (or 8990 counting only the distinct ones).
The product of its digits is 276480, while the sum is 41.
The square root of 6851423264 is about 82773.3245919239. The cubic root of 6851423264 is about 1899.3001359582.
The spelling of 6851423264 in words is "six billion, eight hundred fifty-one million, four hundred twenty-three thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •