Base | Representation |
---|---|
bin | 10010010000111111… |
… | …00010010001001000 |
3 | 221022102000120221222 |
4 | 21020133202101020 |
5 | 130040334122333 |
6 | 4301020021212 |
7 | 465001664402 |
oct | 111037422110 |
9 | 27272016858 |
10 | 9806160968 |
11 | 418235a96a |
12 | 1a98091808 |
13 | c037ac516 |
14 | 690505b72 |
15 | 3c5d6e298 |
hex | 2487e2448 |
9806160968 has 36 divisors (see below), whose sum is σ = 18587761065. Its totient is φ = 4850003808.
The previous prime is 9806160967. The next prime is 9806160979. The reversal of 9806160968 is 8690616089.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 9366755524 + 439405444 = 96782^2 + 20962^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=70022.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (9806160961) 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 8 ways as a sum of consecutive naturals, for example, 43973705 + ... + 43973927.
Almost surely, 29806160968 is an apocalyptic number.
It is an amenable number.
9806160968 is a deficient number, since it is larger than the sum of its proper divisors (8781600097).
9806160968 is an equidigital number, since it uses as much as digits as its factorization.
9806160968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 766 (or 382 counting only the distinct ones).
The product of its (nonzero) digits is 1119744, while the sum is 53.
The square root of 9806160968 is about 99026.0620644889. The cubic root of 9806160968 is about 2140.4233133532.
The spelling of 9806160968 in words is "nine billion, eight hundred six million, one hundred sixty thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •