Properties of the Number 11961

Eleven Thousand Nine Hundred Sixty-One

Basics

Value: 11960 → 11961 → 11962

Parity: odd

Prime: No

Previous Prime: 11959

Next Prime: 11969

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 443

Divisors: 1, 3, 9, 27, 443, 1329, 3987, 11961

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111010111001

Octal: 27271

Duodecimal: 6B09

Hexadecimal: 2eb9

Square: 143065521

Square Root: 109.36635680134911

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

Triangular matrix T, read by rows, where row n equals row (n-1) of T^n-1 after appending '1' for the main diagonal. A101479

Column 1 of triangular matrix T=A101479, in which row n equals row (n-1) of T^n-1 followed by '1'. A101482

Square array, read by antidiagonals, where T(n,k) = T(n,k-1) + T(n-1,k+n-1) for n>0, k>0, such that T(n,0) = T(n-1,n-1) for n>0 with T(0,k)=1 for k>=0. A136730

Triangle read by rows in which the binomial transform of the n-th row gives the Euler transform of the n-th diagonal of Pascal's triangle (A007318). A116672

Magnetic Tower of Hanoi, number of moves of disk number k, optimally solving the [NEUTRAL ; NEUTRAL ; NEUTRAL] pre-colored puzzle. A183117

Number of ternary sequences which contain 000. A231430

Convolution of sequence of primes with sequence σ(n). A86718

Odd composite integers m such that A006190(2·m-J(m,13)) == 1 (mod m), where J(m,13) is the Jacobi symbol. A340119

Number of ON cells after n generations of two-dimensional automaton based on knight moves (see Comments for definition; here a cell is turned ON if 1 or 2 neighbors are ON). A322055

Odd composite integers m such that A006497(3·m-J(m,13)) == 11·J(m,13) (mod m), where J(m,13) is the Jacobi symbol. A339725