Properties of the Number 23851

Twenty-Three Thousand Eight Hundred Fifty-One

Basics

Value: 23850 → 23851 → 23852

Parity: odd

Prime: No

Previous Prime: 23833

Next Prime: 23857

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 17 × 23 × 61

Divisors: 1, 17, 23, 61, 391, 1037, 1403, 23851

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110100101011

Octal: 56453

Duodecimal: 11977

Hexadecimal: 5d2b

Square: 568870201

Square Root: 154.4376897004096

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..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly one way, and new values 0..1 introduced in row major order. A204492

Odd composite integers m such that A004187(m-J(m,45)) == 0 (mod m) and gcd(m,45)=1, where J(m,45) is the Jacobi symbol. A340099

Number of (n+2)X5 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly one way, and new values 0..1 introduced in row major order. A204487

Number of (n+2)X8 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly one way, and new values 0..1 introduced in row major order. A204490

Number of nX3 0..1 arrays with every element equal to 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A298897

Half the number of n X n binary matrices, symmetric under 90-degree rotation, having equal row sums. A140884

Sum of exponents in prime-power factorization of binomial(5n, 2n+2). A23851

Square array A(n,k), n>=0, k>=0, read by antidiagonals, A(n,k) = exponential transform applied n times to identity function, evaluated at k. A209631

Number of 6Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 neighboring 1s. A297436