Properties of the Number 41835

Forty-One Thousand Eight Hundred Thirty-Five

Basics

Value: 41834 → 41835 → 41836

Parity: odd

Prime: No

Previous Prime: 41813

Next Prime: 41843

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 2789

Divisors: 1, 3, 5, 15, 2789, 8367, 13945, 41835

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010001101101011

Octal: 121553

Duodecimal: 20263

Hexadecimal: a36b

Square: 1750167225

Square Root: 204.536060390338

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

Motzkin numbers: number of ways of drawing any number of nonintersecting chords joining n (labeled) points on a circle. A1006

Expansion of (1 + x - sqrt(1 - 2·x - 3·x²)) / 2 in powers of x. A86246

Table where the entry (n,k) (n >= 0, k >= 0) gives number of Motzkin paths of the length n with the minimum peak width of k. A64645

Bisection of Motzkin numbers A001006. A99250

A signed variant of the Motzkin numbers. A166587

Expansion of (3 -x -sqrt(1-2·x-3·x²))/2. A168049

Expansion of (1+x+sqrt(1-2x-3x²))/2. A168051

Triangle read by rows: T(n,k) is the number of involutions of {1,2,...,n} having genus k (see first comment for definition of genus). A178515

Triangle read by rows: T(n,k)=number of ordered trees with n edges and k branch nodes at odd height. A91958

Expansion of (1 - x + sqrt(1 - 2·x - 3·x²))/2 in powers of x. A292440