Properties of the Number 16366

Sixteen Thousand Three Hundred Sixty-Six

Basics

Value: 16365 → 16366 → 16367

Parity: even

Prime: No

Previous Prime: 16363

Next Prime: 16369

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 7 ² × 167

Divisors: 1, 2, 7, 14, 49, 98, 167, 334, 1169, 2338

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111111101110

Octal: 37756

Duodecimal: 957A

Hexadecimal: 3fee

Square: 267845956

Square Root: 127.92966817747946

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

T(n,k)=Number of nXk 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X(k+1) binary array having a sum of two, with rows and columns of the latter in lexicographically nondecreasing order. A227103

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 461", based on the 5-celled von Neumann neighborhood. A282369

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 433", based on the 5-celled von Neumann neighborhood. A288201

Numbers k such that σ(k) = σ(k - d(k)). A277273

a(1) = 2; for n > 1, a(n) = a(n-1)*prime(n) if a(n-1) <= prime(n), otherwise a(n) = a(n-1) mod prime(n). A387775

a(n) = 2n+3ⁿ+5ⁿ. A120949

Number of nX3 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X4 binary array having a sum of two, with rows and columns of the latter in lexicographically nondecreasing order. A227100

Records of A112591. A375235

Number of convex polygons of length 2n on honeycomb, or EG-convex polyominoes. A6743

T(n,k)=Number of nondecreasing arrangements of n+2 numbers in 0..k with each number being the sum mod (k+1) of two others. A183912