Properties of the Number 45542

Forty-Five Thousand Five Hundred Forty-Two

Basics

Value: 45541 → 45542 → 45543

Parity: even

Prime: No

Previous Prime: 45541

Next Prime: 45553

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 7 × 3253

Divisors: 1, 2, 7, 14, 3253, 6506, 22771, 45542

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011000111100110

Octal: 130746

Duodecimal: 22432

Hexadecimal: b1e6

Square: 2074073764

Square Root: 213.40571688687254

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

Expansion of (1-x)/(1-x-2·x²+x³). A52547

Number of Catalan paths (nonnegative, starting and ending at 0, step +/-1) of 2·n steps with all values <= 5. A80937

Number of walks of length n on P₃ plus a loop at the end. A96976

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having the sum of its diagonal elements less than the absolute difference of its antidiagonal elements. A251402

Let i be in {1,2,3} and let r >= 0 be an integer. Let p = {p₁, p₂, p₃} = {-2,0,1}, n=2·r+p_i, and define a(-2)=0. Then, a(n)=a(2·r+p_i) gives the quantity of H_7,2,0 tiles in a subdivided H_7,i,r tile after linear scaling by the factor x^r, where x=sqrt(2·cos(π/7)). A187066

Let i be in {1,2,3} and let r >= 0 be an integer. Let p = {p₁, p₂, p₃} = {-2,0,1}, n=2·r+p_i, and define a(-2)=1. Then, a(n)=a(2·r+p_i) gives the quantity of H_7,1,0 tiles in a subdivided H_7,i,r tile after linear scaling by the factor x^r, where x=sqrt(2·cos(π/7)). A187065

Expansion of ∏_k>=1 (1 + x^{2·k - 1})^k². A294749

Number of (n+1)X(1+1) 0..3 arrays with no 2X2 subblock having the sum of its diagonal elements less than the absolute difference of its antidiagonal elements. A251395

Number of (n+1)X(3+1) 0..3 arrays with no 2X2 subblock having the sum of its diagonal elements less than the absolute difference of its antidiagonal elements. A251397

a(n) = a(n-1) + a(n-2) if n is even and a(n) = a(n-3) + a(n-4) if n is odd, with a(0) = a(1) = a(2) = 0 and a(3) = 1. A265755