Properties of the Number 23565

Twenty-Three Thousand Five Hundred Sixty-Five

Basics

Value: 23564 → 23565 → 23566

Parity: odd

Prime: No

Previous Prime: 23563

Next Prime: 23567

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 1571

Divisors: 1, 3, 5, 15, 1571, 4713, 7855, 23565

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101110000001101

Octal: 56015

Duodecimal: 11779

Hexadecimal: 5c0d

Square: 555309225

Square Root: 153.50895739337167

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..1 arrays with every element equal to 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero. A301951

T(n,k)=Number of nXk 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes. A278385

The smallest k >= 0 that can be represented as a linear combination of 1², 2², ..., n² with coefficients +-1 and that cannot be represented using 1², 2², ..., m² with 1<=m<n. A392127

a(n) = a(n-2) + 2·a(n-3) for n >= 3, where a(0) = 2, a(2) = 4, a(3) = 5. A288668

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 165", based on the 5-celled von Neumann neighborhood. A270459

Number of n X 2 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly three mistakes. A278379

Number of nX7 0..1 arrays with every element equal to 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero. A301950

Number of 3Xn 0..1 arrays with every element equal to 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero. A301952

Number of Sophie Germain primes <= prime(2ⁿ). A60200

Let P(A) be the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are disjoint and for which either·is a subset of y or y is a subset of x, or 1) x and y are intersecting but for which·is not a subset of y and y is not a subset of x. A134018