Properties of the Number 23014

Twenty-Three Thousand Fourteen

Basics

Value: 23013 → 23014 → 23015

Parity: even

Prime: No

Previous Prime: 23011

Next Prime: 23017

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 37 × 311

Divisors: 1, 2, 37, 74, 311, 622, 11507, 23014

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 101100111100110

Octal: 54746

Duodecimal: 1139A

Hexadecimal: 59e6

Square: 529644196

Square Root: 151.7036584924701

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

a(n) is the number of completed steps before being trapped for a knight moving on a square-spiral numbered board where the knight moves to an unvisited square with the lowest spiral number and with n or fewer visited neighbors. It only moves to squares with n+1 or more visited neighbors when no other squares are available, and if two or more such squares are present it chooses the square with the fewest visited neighbors, then the square with the lowest spiral number if still tied. A329520

Sums of terms of groups in A075626. A75629

The Hwang-Deutsch function f₃(n). A260996

a(0) = a(1) = 1. a(n) = a(n-1) + a(n - b(n)), where b(n) is largest prime dividing n. A137809

Numbers k such that 37·2^k+1 is prime. A32368

Number of (n+2) X (3+2) 0..1 arrays with no 3·3 subblock diagonal sum 1 and no antidiagonal sum 2 and no row sum 0 and no column sum 3. A255796

Number of partitions of n into parts of 16 kinds. A23014

Squares visited by a knight moving on a square-spiral numbered board where the knight moves to an unvisited square with the lowest spiral number and with seven or fewer visited neighbors. It only moves to squares with eight visited neighbors when no other square is available. A329518

Number of nX7 0..1 arrays with every element unequal to 0, 1, 2 or 5 king-move adjacent elements, with upper left element zero. A303960