Properties of the Number 9961

Nine Thousand Nine Hundred Sixty-One

Basics

Value: 9960 → 9961 → 9962

Parity: odd

Prime: No

Previous Prime: 9949

Next Prime: 9967

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 7 × 1423

Divisors: 1, 7, 1423, 9961

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10011011101001

Octal: 23351

Duodecimal: 5921

Hexadecimal: 26e9

Square: 99221521

Square Root: 99.80480950335009

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Values of n such that L(12) and N(12) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227515

Molien series for invariants of finite Coxeter group A₁₂. A266781

Number of ON cells after n generations of two-dimensional automaton based on knight moves (see Comments for definition). A319018

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 or 1 and no antidiagonal sum 0 or 1 and no row sum 0 and no column sum 0. A254978

One of the two successive approximations up to 2ⁿ for 2-adic integer sqrt(17). This is the 1 (mod 4) case. A341538

Number T(n,k) of set partitions of [n] such that the maximal value of all absolute differences between least elements of consecutive blocks and between consecutive elements within the blocks equals k; triangle T(n,k), n>=0, 0<=k<=max(n-1,0), read by rows. A287416

Fourth row of Pascal-(1,3,1) array A081578. A81586

a(n) = (4·n³ - 6·n² + 14·n + 3)/3. A321124

a(n+1) = a(n) converted to base 10 from base 11. A55982

Pseudo-random numbers: MS C 6.0 version. A84275