Properties of the Number 33858

Thirty-Three Thousand Eight Hundred Fifty-Eight

Basics

Value: 33857 → 33858 → 33859

Parity: even

Prime: No

Previous Prime: 33857

Next Prime: 33863

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ⁴ × 11 × 19

Divisors: 1, 2, 3, 6, 9, 11, 18, 19, 22, 27

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010001000010

Octal: 102102

Duodecimal: 17716

Hexadecimal: 8442

Square: 1146364164

Square Root: 184.00543470234786

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 arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor. A221087

Euler transform of A051064, the ruler function sequence for k=3. A173241

Number of endless self-avoiding walks of length n on the triangular lattice. A334331

The fourth left hand column of triangle A167565. A167567

Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of f(i,j)=min(3i-2,3j-2) (A204028). A204029

Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,2. A37501

Denominators of e.g.f.: tan(arccosh(x)) = cot(arcsinh(x)). A102062

Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 3 (0<=k<=floor(n/3)). Also number of ordered trees with n edges that have k vertices of outdegree 3. A114506

Minimal covering numbers. A160559

a(n) = 90·binomial(n-1,7) + 9·binomial(n-1,6). A274502