Base | Representation |
---|---|
bin | 10010000010011000… |
… | …10110000011000101 |
3 | 220222212120101220221 |
4 | 21001030112003011 |
5 | 124313011032134 |
6 | 4240523024341 |
7 | 461654001253 |
oct | 110114260305 |
9 | 26885511827 |
10 | 9683689669 |
11 | 411a210415 |
12 | 1a6306b0b1 |
13 | bb42cb7b4 |
14 | 67c1455d3 |
15 | 3ba22b5b4 |
hex | 2413160c5 |
9683689669 has 2 divisors, whose sum is σ = 9683689670. Its totient is φ = 9683689668.
The previous prime is 9683689667. The next prime is 9683689681. The reversal of 9683689669 is 9669863869.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8155896100 + 1527793569 = 90310^2 + 39087^2 .
It is a cyclic number.
It is not a de Polignac number, because 9683689669 - 21 = 9683689667 is a prime.
It is a super-2 number, since 2×96836896692 (a number of 21 digits) contains 22 as substring.
Together with 9683689667, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 9683689598 and 9683689607.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9683689667) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4841844834 + 4841844835.
It is an arithmetic number, because the mean of its divisors is an integer number (4841844835).
Almost surely, 29683689669 is an apocalyptic number.
It is an amenable number.
9683689669 is a deficient number, since it is larger than the sum of its proper divisors (1).
9683689669 is an equidigital number, since it uses as much as digits as its factorization.
9683689669 is an evil number, because the sum of its binary digits is even.
The product of its digits is 181398528, while the sum is 70.
The square root of 9683689669 is about 98405.7400205903. The cubic root of 9683689669 is about 2131.4752187193.
The spelling of 9683689669 in words is "nine billion, six hundred eighty-three million, six hundred eighty-nine thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •