Properties of the Number 52920

Fifty-Two Thousand Nine Hundred Twenty

Basics

Value: 52919 → 52920 → 52921

Parity: even

Prime: No

Previous Prime: 52919

Next Prime: 52937

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ³ × 5 × 7 ²

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100111010111000

Octal: 147270

Duodecimal: 26760

Hexadecimal: ceb8

Square: 2800526400

Square Root: 230.04347415216978

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

Triangle of coefficients of Laguerre polynomials n!*L_n(x) (rising powers of x). A21009

a(n) = n! * n(n-1)/4. A1809

T(n,k) is the number of partial bijections of height k (height(α) = |Im(α)|) of an n-element set. A144084

Coefficients in q-expansion of (E₂*E₄ - E₆)/720, where E₂, E₄, E₆ are the Eisenstein series shown in A006352, A004009, A013973, respectively. A281372

Triangle read by rows: a(n, m) = S1(n, m)*3^n-m, where S1 are the signed Stirling numbers of first kind A008275 (n >= 1, 1 <= m <= n). A51141

Fourth power of lower triangular matrix of A056857 (successive equalities in set partitions of n). A78939

Array of coefficients of denominator polynomials of the n-th approximation of the continued fraction x/(1+x/(2+x/(3+..., related to Laguerre polynomial coefficients. A84950

Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having exactly k blocks that contain both odd and even entries (0<=k<=floor(n/2)). A124418

A partition product of Stirling₂ type [parameter k = 1] with biggest-part statistic (triangle read by rows). A157401

T(n, k) = ∑_j=0..k (-1)^j*binomial(2·k, j)*(k - j)^2·n, triangle read by rows, n >= 0 and 0 <= k <= n. A304330