ℕ atory
Play Now

Properties of the Number 16962

Sixteen Thousand Nine Hundred Sixty-Two

Basics

Value: 16961 → 16962 → 16963

Parity: even

Prime: No

Previous Prime: 16943

Next Prime: 16963

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 11 × 257

Divisors: 1, 2, 3, 6, 11, 22, 33, 66, 257, 514

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100001001000010

Octal: 41102

Duodecimal: 9996

Hexadecimal: 4242

Square: 287709444

Square Root: 130.238243231395

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

Numbers whose binary representation traces a nonselfcrossing circuit in honeycomb lattice when its bits (from the least to the second most significant bit) are interpreted as directions to proceed at each vertex. (The most significant 1-bit is ignored). A255571
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k long ascents (i.e., ascents of length at least 2). Rows are of length 1,1,2,2,3,3,... . A91156
Total sum of even parts in the last section of the set of partitions of n. A206436
Triangle read by rows: T(n,k) is the number of 2-Motzkin paths (i.e., Motzkin paths with blue and red level steps) without red level steps on the x-axis, having length n and k level steps (0 <= k <= n). A126222
G.f.: exp( ∑n>=1 3·Jacobsthal(n2) * xn/n ), where Jacobsthal(n) = A001045(n). A211892
Triangle read by rows: a(n,k) = number of permutations in Sn which avoid the pattern 123 and have exactly k descents. A166073
Number of Dyck paths of semilength n+4, having exactly two long ascents (i.e., ascents of length at least two). A91135
Number of n-step up-side self-avoiding walks on the lattice strip {0,1,2} x Z (up-side means that the walks move up and sideways but not down). A171857
Number of separable partitions of n in which the number of distinct (repeatable) parts <= 5. A325714
Revert transform of (1 + x - 4x2 - x3)/(1 + 2x - 2x2 - 2x3). A49141