Properties of the Number 16556

Sixteen Thousand Five Hundred Fifty-Six

Basics

Value: 16555 → 16556 → 16557

Parity: even

Prime: No

Previous Prime: 16553

Next Prime: 16561

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 4139

Divisors: 1, 2, 4, 4139, 8278, 16556

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100000010101100

Octal: 40254

Duodecimal: 96B8

Hexadecimal: 40ac

Square: 274101136

Square Root: 128.67012085173465

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 array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 4·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x². A367209

T(n,k) is the number of lower triangles of an n X n 0..k array with new values introduced in row major order 0..k and no element equal to more than one horizontal or vertical neighbor. A194540

#4 in an infinite set of generalized Pascal's triangles with trigonometric properties. A125077

a(n) is the n-th diagonal sum of left justified array T given by A027960. A27975

Pascal-like triangle with trigonometric properties, row sums = powers of 4; generated from shifted columns of triangle A180062. A180063

Number of planar partitions of n with trace 4. A89351

Number of lower triangles of an n X n 0..3 array with new values introduced in row major order 0..3 and no element equal to more than one horizontal or vertical neighbor. A194535

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 517", based on the 5-celled von Neumann neighborhood. A272732

Number of equivalence classes of convex lattice polygons containing n lattice points, restricting the count to those polygons that are interior to another polygon. A377245

a(n) = k where k*π is the solution to sin(x) = 0 obtained using Newton's method starting from x = n. A381781