Properties of the Number 6896

Six Thousand Eight Hundred Ninety-Six

Basics

Value: 6895 → 6896 → 6897

Parity: even

Prime: No

Previous Prime: 6883

Next Prime: 6899

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ⁴ × 431

Divisors: 1, 2, 4, 8, 16, 431, 862, 1724, 3448, 6896

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101011110000

Octal: 15360

Duodecimal: 3BA8

Hexadecimal: 1af0

Square: 47554816

Square Root: 83.04215796810678

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..5 arrays with no element x(i,j) adjacent to value 5-x(i,j) horizontally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order. A233217

T(n,k)=Number of nXk 0..5 arrays with no element x(i,j) adjacent to value 5-x(i,j) horizontally, diagonally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order. A233239

T(n,k)=Number of nXk 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabelled 6-colorings with no clashing color pairs). A233256

T(n,k)=Number of nXk 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally, diagonally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabelled 6-colorings with no clashing color pairs). A233174

E.g.f.: exp(8·x*G(x)⁷) / G(x)⁷ where G(x) = 1 + x·G(x)⁸ is the g.f. of A007556. A251578

T(n,k)=Number of black-square subarrays of (n+2)X(k+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero. A230935

G.f. satisfies: A(x) = 1/(1 + x·A(x⁸)) and also the continued fraction: 1 + x·A(x⁹) = [1; 1/x, 1/x⁸, 1/x⁶⁴, 1/x⁵¹², ..., 1/x^{8^(n-1}), ...]. A101918

T(n,k)=Number of nXk 0..7 arrays with no element x(i,j) adjacent to itself or value 7-x(i,j) horizontally, diagonally, antidiagonally or vertically, top left element zero, and 1 appearing before 2 3 4 5 and 6, 2 appearing before 3 4 and 5, and 3 appearing before 4 in row major order (unlabeled 8-colorings with no clashing color pairs). A233168

T(n,k)=Number of nXk 0..7 arrays with no element x(i,j) adjacent to itself or value 7-x(i,j) horizontally, antidiagonally or vertically, top left element zero, and 1 appearing before 2 3 4 5 and 6, 2 appearing before 3 4 and 5, and 3 appearing before 4 in row major order (unlabelled 8-colorings with no clashing color pairs). A233202

Numbers n such that the decimal number concat(2,n) is a square. A273357