Base | Representation |
---|---|
bin | 110010110100110… |
… | …001000001010000 |
3 | 2012102111021222220 |
4 | 302310301001100 |
5 | 3221242134242 |
6 | 220340101040 |
7 | 30062525430 |
oct | 6264610120 |
9 | 2172437886 |
10 | 852693072 |
11 | 3a8360a20 |
12 | 1b9694780 |
13 | 10787201a |
14 | 813642c0 |
15 | 4ecd4bec |
hex | 32d31050 |
852693072 has 320 divisors, whose sum is σ = 2987808768. Its totient is φ = 202752000.
The previous prime is 852693059. The next prime is 852693109. The reversal of 852693072 is 270396258.
It is a Harshad number since it is a multiple of its sum of digits (42).
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 63 ways as a sum of consecutive naturals, for example, 2575947 + ... + 2576277.
Almost surely, 2852693072 is an apocalyptic number.
852693072 is a gapful number since it is divisible by the number (82) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 852693072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1493904384).
852693072 is an abundant number, since it is smaller than the sum of its proper divisors (2135115696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
852693072 is a wasteful number, since it uses less digits than its factorization.
852693072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418 (or 412 counting only the distinct ones).
The product of its (nonzero) digits is 181440, while the sum is 42.
The square root of 852693072 is about 29200.9087529823. The cubic root of 852693072 is about 948.2675987958.
The spelling of 852693072 in words is "eight hundred fifty-two million, six hundred ninety-three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •