Properties of the Number 23884

Twenty-Three Thousand Eight Hundred Eighty-Four

Basics

Value: 23883 → 23884 → 23885

Parity: even

Prime: No

Previous Prime: 23879

Next Prime: 23887

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 7 × 853

Divisors: 1, 2, 4, 7, 14, 28, 853, 1706, 3412, 5971

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 101110101001100

Octal: 56514

Duodecimal: 119A4

Hexadecimal: 5d4c

Square: 570445456

Square Root: 154.544491975612

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

Expansion of (-1 + ∏_k>=1 1 / (1 + (-x)^k))⁴. A341243

Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^n-1 starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words·and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k > 1. A93370

Lower triangular matrix T, read by rows, that shifts left one column under the matrix square of T, with T(n,0)=T(n,1) for n>0 and T(n,n)=1 for n>=0. A98539

T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, no adjacent elements equal, and upper left element zero. A230899

Number of unlabeled 7-ary cacti having n polygons. A54369

a(n) = A121880(2·n)/2. A211973

Column 2 of triangle A098539, which shifts left one column under the matrix square. A98541

Number n such that the sum of its proper evil divisors (A001969) equals n. A230587

Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 7. A240016

Number of nX4 0..3 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, no adjacent elements equal, and upper left element zero. A230895