Base | Representation |
---|---|
bin | 110000011100011… |
… | …010000011011100 |
3 | 2002122100010200021 |
4 | 300130122003130 |
5 | 3131031044431 |
6 | 212352041524 |
7 | 26066200420 |
oct | 6034320334 |
9 | 2078303607 |
10 | 812753116 |
11 | 38786149a |
12 | 1a82332a4 |
13 | cc4c9906 |
14 | 79d28b80 |
15 | 4b545b11 |
hex | 3071a0dc |
812753116 has 48 divisors (see below), whose sum is σ = 1701536256. Its totient is φ = 332126784.
The previous prime is 812753113. The next prime is 812753167. The reversal of 812753116 is 611357218.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (812753111) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 221650 + ... + 225286.
It is an arithmetic number, because the mean of its divisors is an integer number (35448672).
Almost surely, 2812753116 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 812753116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (850768128).
812753116 is an abundant number, since it is smaller than the sum of its proper divisors (888783140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
812753116 is a wasteful number, since it uses less digits than its factorization.
812753116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4018 (or 4016 counting only the distinct ones).
The product of its digits is 10080, while the sum is 34.
The square root of 812753116 is about 28508.8252300932. The cubic root of 812753116 is about 933.2246774305.
The spelling of 812753116 in words is "eight hundred twelve million, seven hundred fifty-three thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •