Properties of the Number 23852

Twenty-Three Thousand Eight Hundred Fifty-Two

Basics

Value: 23851 → 23852 → 23853

Parity: even

Prime: No

Previous Prime: 23833

Next Prime: 23857

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 67 × 89

Divisors: 1, 2, 4, 67, 89, 134, 178, 268, 356, 5963

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110100101100

Octal: 56454

Duodecimal: 11978

Hexadecimal: 5d2c

Square: 568917904

Square Root: 154.44092721814383

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+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 or -1,-2. A264285

Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 4. A209988

Number of increasing sequences of star chain type with maximal element n. A8927

Number of tilings of a 5 X n rectangle using n pentominoes of shapes N, U, Z. A358933

The smallest term in A061862 with exactly n distinct partitions into a sum of nonnegative powers of its digits. A388297

Number of symmetric short bushes with n edges. A82958

Number of (n+1)X(6+1) arrays of permutations of 0..n·7+6 with each element having directed index change 0,0 0,1 1,0 or -1,-2. A264283

Number of (3+1)X(n+1) arrays of permutations of 0..n·4+3 with each element having directed index change 0,0 0,1 1,0 or -1,-2. A264287

T(n,n+1), array T as in A047040; T(n+1,n), array T given by A047050. A47046

Sum of exponents in prime-power factorization of binomial(6n, n). A23852