Properties of the Number 23136

Twenty-Three Thousand One Hundred Thirty-Six

Basics

Value: 23135 → 23136 → 23137

Parity: even

Prime: No

Previous Prime: 23131

Next Prime: 23143

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁵ × 3 × 241

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101101001100000

Octal: 55140

Duodecimal: 11480

Hexadecimal: 5a60

Square: 535274496

Square Root: 152.10522673465235

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

a(1)=3, a(2)=2, a(n)=3·a(n-1) + 2·a(n-2). A189736

T(n,k) is the number of arrays of n+2 elements from {0,1,...,k} with no two consecutive ascents. A200785

G.f. A(x) satisfies: A(x - x·A(x)) = x + x·A(x). A276358

Number of fixed poly-[3⁴.6]-tiles (holes allowed) with n cells. A197160

Record values in A046641. A145771

-a(n)/7! is the coefficient of x⁷ in the Taylor expansion of the k-th iteration of sin(x). A366827

a(n) = n * [1 + sum(k=1 to n) prime(k)]. A83725

Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k returns to the x-axis (i.e., d or u steps hitting the x-axis). A109193

Triangle read by rows: T(n,k) is the number of length n left factors of Dyck paths having k UUDD's, where U=(1,1) and D=(1,-1). A191793

Number of 0..7 arrays x(0..n+1) of n+2 elements without any two consecutive increases. A200784