Properties of the Number 41944

Forty-One Thousand Nine Hundred Forty-Four

Basics

Value: 41943 → 41944 → 41945

Parity: even

Prime: No

Previous Prime: 41941

Next Prime: 41947

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 7 ² × 107

Divisors: 1, 2, 4, 7, 8, 14, 28, 49, 56, 98

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010001111011000

Octal: 121730

Duodecimal: 20334

Hexadecimal: a3d8

Square: 1759299136

Square Root: 204.8023437365891

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

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

a(n) = ∑_i=0..n digsum₅(i)⁴, where digsum₅(i) = A053824(i). A231671

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

Numerators of convergents to cube root of 5. A2358

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

Number of (binary) max-heaps on n elements from the set {0,1} containing exactly nine 0's. A326510

a(n) = n²*(n+1)*(4·n³ - 2·n² + n + 3)/12. A101380

Number of distinct sums of reciprocals of parts of partitions of n. A212187

Number of walks of length 2n on the square lattice that start and end at (0,0) and avoid the negative quadrant. A260155