Properties of the Number 23286

Twenty-Three Thousand Two Hundred Eighty-Six

Basics

Value: 23285 → 23286 → 23287

Parity: even

Prime: No

Previous Prime: 23279

Next Prime: 23291

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 3881

Divisors: 1, 2, 3, 6, 3881, 7762, 11643, 23286

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101101011110110

Octal: 55366

Duodecimal: 11586

Hexadecimal: 5af6

Square: 542237796

Square Root: 152.59750980930193

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

Number of partitions of n if there are two kinds of 1's and two kinds of 2's. A97

Number of partitions of n having no parts with multiplicity 6. A184641

Convolution triangle, read by rows, where diagonals are successive self-convolutions of A118351. A118354

Number of partitions of n containing no part i of multiplicity i-1. A277102

Number of inversion sequences avoiding the vincular pattern 10-0 (or 10-1). A336070

Central terms of pendular triangle A118350. A118351

Number of distinct n X n patterns in the squiral tiling. A375874

Number of permutations (p(1),p(2),...,p(n)) of (1,2,...,n) such that p(i)-i is in {-2,3,4} for all i=1,...,n. A377715

Pendular triangle, read by rows, where row n is formed from row n-1 by the recurrence: if n > 2k, T(n,k) = T(n,n-k) + T(n-1,k), else T(n,k) = T(n,n-1-k) + 3·T(n-1,k), for n>=k>=0, with T(n,0)=1 and T(n,n)=0ⁿ. A118350

Primes that remain prime through 3 iterations of function f(x) = 5x + 8. A23286