Properties of the Number 16204

Sixteen Thousand Two Hundred Four

Basics

Value: 16203 → 16204 → 16205

Parity: even

Prime: No

Previous Prime: 16193

Next Prime: 16217

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 4051

Divisors: 1, 2, 4, 4051, 8102, 16204

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11111101001100

Octal: 37514

Duodecimal: 9464

Hexadecimal: 3f4c

Square: 262569616

Square Root: 127.29493312775651

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 subsets of {1..n} (including empty set) such that the pairwise GCDs of elements are not distinct. A196720

Number of compositions of n such that the number of parts and the smallest part are coprime. A199888

Number of ways that a 1 X n rectangular tile T, marked into n unit squares, can be surrounded by one layer of copies of itself laid in the plane grid generated by the units of T. Ways that differ by rotation or reflection are not counted as different. The surrounded tile is the exact surrounded region. A159294

a(n) = ceiling((2ⁿ + 1 - 2·floor(2^n/2))/2). A129757

Total number of ordered k-tuples (k=0..n) of distinct elements from an n-element set: a(n) = ∑_k=0..n n!/k!. A522

Expansion of series_reversion( x/(1+x⁴*sum(k>=0, x^k)) ) / x. A215341

Number of ways to write n as x² + y² + z² + w² with (3·x)² + (4·y)² + (12·z)² a square , where w is a positive integer and x,y,z are nonnegative integers such that z or 2·z or 3·z is a square. A300908

Expansion of 1/((1-x)*(1-2·x)*(1-9·x)). A16204

Number of nX4 0..1 arrays with every element unequal to 1, 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A317218

Table read by antidiagonals: T(h,n) is the number of n-step self avoiding walks on a 2D square grid confined to an infinite strip of height h where the walk starts at the origin. A336769