Base | Representation |
---|---|
bin | 1100110000110111… |
… | …11001001011101000 |
3 | 122200120000210220210 |
4 | 12120123321023220 |
5 | 103013204304412 |
6 | 3051543021120 |
7 | 331544401614 |
oct | 63033711350 |
9 | 18616023823 |
10 | 6852416232 |
11 | 29a7012812 |
12 | 13b2a3a7a0 |
13 | 852871a7c |
14 | 490100344 |
15 | 2a18b583c |
hex | 1986f92e8 |
6852416232 has 64 divisors (see below), whose sum is σ = 17472024000. Its totient is φ = 2238900224.
The previous prime is 6852416189. The next prime is 6852416237. The reversal of 6852416232 is 2326142586.
It is not an unprimeable number, because it can be changed into a prime (6852416237) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 492994 + ... + 506702.
It is an arithmetic number, because the mean of its divisors is an integer number (273000375).
Almost surely, 26852416232 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 6852416232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8736012000).
6852416232 is an abundant number, since it is smaller than the sum of its proper divisors (10619607768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6852416232 is a wasteful number, since it uses less digits than its factorization.
6852416232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14130 (or 14126 counting only the distinct ones).
The product of its digits is 138240, while the sum is 39.
The square root of 6852416232 is about 82779.3224905834. The cubic root of 6852416232 is about 1899.3918859048.
The spelling of 6852416232 in words is "six billion, eight hundred fifty-two million, four hundred sixteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •