Base | Representation |
---|---|
bin | 10000001010111111… |
… | …01100110100110101 |
3 | 211102001221221100211 |
4 | 20011133230310311 |
5 | 120240111140431 |
6 | 3553304105421 |
7 | 425102615344 |
oct | 100537546465 |
9 | 24361857324 |
10 | 8682130741 |
11 | 3755922369 |
12 | 1823765271 |
13 | a84966b8b |
14 | 5c510db5b |
15 | 35c33d2b1 |
hex | 2057ecd35 |
8682130741 has 8 divisors (see below), whose sum is σ = 9208151064. Its totient is φ = 8157811200.
The previous prime is 8682130703. The next prime is 8682130757. The reversal of 8682130741 is 1470312868.
It can be written as a sum of positive squares in 4 ways, for example, as 1888250116 + 6793880625 = 43454^2 + 82425^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 8682130741 - 225 = 8648576309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 8682130694 and 8682130703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8682130141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 414670 + ... + 435103.
It is an arithmetic number, because the mean of its divisors is an integer number (1151018883).
Almost surely, 28682130741 is an apocalyptic number.
It is an amenable number.
8682130741 is a deficient number, since it is larger than the sum of its proper divisors (526020323).
8682130741 is a wasteful number, since it uses less digits than its factorization.
8682130741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 850391.
The product of its (nonzero) digits is 64512, while the sum is 40.
The square root of 8682130741 is about 93177.9520111920. The cubic root of 8682130741 is about 2055.3010328138.
The spelling of 8682130741 in words is "eight billion, six hundred eighty-two million, one hundred thirty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •