Properties of the Number 16922

Sixteen Thousand Nine Hundred Twenty-Two

Basics

Value: 16921 → 16922 → 16923

Parity: even

Prime: No

Previous Prime: 16921

Next Prime: 16927

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 8461

Divisors: 1, 2, 8461, 16922

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100001000011010

Octal: 41032

Duodecimal: 9962

Hexadecimal: 421a

Square: 286354084

Square Root: 130.08458786497346

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

Number of 2's in the last section of the set of partitions of n. A182712

a(n) = ∑_k=0..n (-1)^n-k*A000041(k). A87787

For a given unrestricted partition π, let P(π)=λ(π), if μ(π)=0. If μ(π)>0 then let P(π)=ν(π), where ν(π) is the number of parts of π greater than μ(π), μ(π) is the number of ones in π and λ(π) is the largest part of π. A100818

Number of maximal subsets of {1..n} containing no sums of distinct elements. A326498

Table read by antidiagonals: T(w,n) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a tube of cross section 2w X 2w where the walk starts at the middle of the tube. A337400

Indices n where a run of primes ends in A376198. A376752

Number of 2's in all partitions of 2n+1 that do not contain 1 as a part. A182717

Number of permutations of 1..n with displacements restricted to {-6,-5,-4,0,1,2,3}. A189599

Number of 4-ary search trees on n keys. A19498

Number of n X n symmetric 0..3 arrays with no element equal to the product mod 4 of any two of its horizontal and vertical neighbors. A193500