Properties of the Number 41658

Forty-One Thousand Six Hundred Fifty-Eight

Basics

Value: 41657 → 41658 → 41659

Parity: even

Prime: No

Previous Prime: 41651

Next Prime: 41659

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 53 × 131

Divisors: 1, 2, 3, 6, 53, 106, 131, 159, 262, 318

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010001010111010

Octal: 121272

Duodecimal: 20136

Hexadecimal: a2ba

Square: 1735388964

Square Root: 204.10291521680918

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(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=2, a(1)=1, a(2)=2. A214899

Let f(z) = z² + c, then row k lists the expansion of the n-fold composition f(f(...f(0)...)) in rising powers of c. A137560

Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), k>=0, k<=n<=2^k-1, read by columns. A335920

Number of binary search trees (BST) on n nodes which have the same height as the optimal BST. A328349

Triangle by rows, related to the numbers of binary trees of height less than n, derived from the Mandelbrot set. A202019

Numerators of continued fraction convergents to sqrt(348). A41658

Triangular sequence of coefficients of the Misiurewicz polynomial which are made from the Pc Mandelbrot -Julia polynomials A137560 as: Pc(x,n)-Pc(x,m); n<>m. A137867