Base | Representation |
---|---|
bin | 10010000010000001… |
… | …10010100110000101 |
3 | 220222122212112012011 |
4 | 21001000302212011 |
5 | 124311222121434 |
6 | 4240334054221 |
7 | 461616155035 |
oct | 110100624605 |
9 | 26878775164 |
10 | 9680660869 |
11 | 4118531880 |
12 | 1a6204a371 |
13 | bb37aacc9 |
14 | 67b9978c5 |
15 | 3b9d2de64 |
hex | 241032985 |
9680660869 has 8 divisors (see below), whose sum is σ = 10694401920. Its totient is φ = 8689200000.
The previous prime is 9680660867. The next prime is 9680660963.
9680660869 is nontrivially palindromic in base 10.
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 9680660869 - 21 = 9680660867 is a prime.
It is a super-2 number, since 2×96806608692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9680660867) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 5569132 + ... + 5570869.
It is an arithmetic number, because the mean of its divisors is an integer number (1336800240).
Almost surely, 29680660869 is an apocalyptic number.
It is an amenable number.
9680660869 is a deficient number, since it is larger than the sum of its proper divisors (1013741051).
9680660869 is a wasteful number, since it uses less digits than its factorization.
9680660869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11140091.
The product of its (nonzero) digits is 6718464, while the sum is 58.
The square root of 9680660869 is about 98390.3494708704. The cubic root of 9680660869 is about 2131.2529726695.
The spelling of 9680660869 in words is "nine billion, six hundred eighty million, six hundred sixty thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •