Properties of the Number 26396

Twenty-Six Thousand Three Hundred Ninety-Six

Basics

Value: 26395 → 26396 → 26397

Parity: even

Prime: No

Previous Prime: 26393

Next Prime: 26399

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 6599

Divisors: 1, 2, 4, 6599, 13198, 26396

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011100011100

Octal: 63434

Duodecimal: 13338

Hexadecimal: 671c

Square: 696748816

Square Root: 162.4684584773303

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 (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7. A252433

Given the associative array U(n,k) described below, numbers m > 5 such that [m-3..m+3] are not in U(n,k) (excluding the first row and column). A345473

Number of connected graphs with n nodes and no node a member of more than one cycle. A317722

Row sums of triangle A135814 (number of coincidence-free m-tuple lists of length n). A135815

Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7. A252430

Number of (4+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7. A252437

Number of points that are the intersections of exactly two semicircles in the configuration A290447(n). A292103

Consider the method used by Archimedes to determine the value of π (A000796). This sequence denotes the number of iterations of his algorithm which would result in a difference of less than 1/10ⁿ from that of π. A244644

∑_T(i,j), 0<=j<=i, 0<=i<=n, where T is the array in A026386. A26396