Properties of the Number 26963

Twenty-Six Thousand Nine Hundred Sixty-Three

Basics

Value: 26962 → 26963 → 26964

Parity: odd

Prime: No

Previous Prime: 26959

Next Prime: 26981

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 59 × 457

Divisors: 1, 59, 457, 26963

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100101010011

Octal: 64523

Duodecimal: 1372B

Hexadecimal: 6953

Square: 727003369

Square Root: 164.20414123888594

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 arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nXk array. A220044

Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x). A97155

Number of nonnegative solutions to x³ + y³ + z³ <= n³. A224215

Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 3Xn array. A220046

Number of nX7 arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nX7 array. A220043

Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 king-move adjacent elements, with upper left element zero. A298288

a(n) = ∑_k=0..n-2 T(n,k) * T(n,k+2), with T given by A026626. A26963

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 king-move adjacent elements, with upper left element zero. A298294