Properties of the Number 40592

Forty Thousand Five Hundred Ninety-Two

Basics

Value: 40591 → 40592 → 40593

Parity: even

Prime: No

Previous Prime: 40591

Next Prime: 40597

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁴ × 43 × 59

Divisors: 1, 2, 4, 8, 16, 43, 59, 86, 118, 172

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001111010010000

Octal: 117220

Duodecimal: 1B5A8

Hexadecimal: 9e90

Square: 1647710464

Square Root: 201.47456415140846

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

E.g.f. tan(x/(1-x)). A219613

A Somos-4 variant: a(n) = (36·a(n-1)*a(n-3) - 68·a(n-2)²)/a(n-4). A162546

G.f.: 1/(1 + x - x² - x³ + x⁴). A199803

Number T(n,k) of colored integer partitions of n using all colors of a k-set such that each block of part i with multiplicity j has a pattern of i·j colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A326500

G.f.: 1/(1 + x + 2·x² + 2·x³ + x⁴). A199744

Sum of the differences between the largest part and smallest part over all partitions of n into distinct parts. A117455

Trisection 0 of A199803. A199930

Number of permutations of [n] having exactly eight alternating descents. A302901

Number of nX6 0..1 arrays avoiding 0 1 0 horizontally and 0 1 1 vertically. A206998

G.f. A(x) satisfies: A(x) = ∑_n>=0 Series_Reversion( x/A(x)ⁿ )ⁿ. A298698