Base | Representation |
---|---|
bin | 1111000111001110… |
… | …10101101000001100 |
3 | 202221110101001022101 |
4 | 13203213111220030 |
5 | 113104102120112 |
6 | 3421040524444 |
7 | 405031243000 |
oct | 74347255014 |
9 | 22843331271 |
10 | 8113707532 |
11 | 3493a81617 |
12 | 16a5320724 |
13 | 9c3c75b98 |
14 | 56d826700 |
15 | 3274ab757 |
hex | 1e39d5a0c |
8113707532 has 48 divisors (see below), whose sum is σ = 16578273600. Its totient is φ = 3473170176.
The previous prime is 8113707523. The next prime is 8113707557. The reversal of 8113707532 is 2357073118.
It is a junction number, because it is equal to n+sod(n) for n = 8113707491 and 8113707500.
It is an unprimeable number.
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, 1337418 + ... + 1343470.
It is an arithmetic number, because the mean of its divisors is an integer number (345380700).
Almost surely, 28113707532 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 8113707532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8289136800).
8113707532 is an abundant number, since it is smaller than the sum of its proper divisors (8464566068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8113707532 is a wasteful number, since it uses less digits than its factorization.
8113707532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7055 (or 7039 counting only the distinct ones).
The product of its (nonzero) digits is 35280, while the sum is 37.
The square root of 8113707532 is about 90076.1207646066. The cubic root of 8113707532 is about 2009.4310850795.
The spelling of 8113707532 in words is "eight billion, one hundred thirteen million, seven hundred seven thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •