Properties of the Number 30520

Thirty Thousand Five Hundred Twenty

Basics

Value: 30519 → 30520 → 30521

Parity: even

Prime: No

Previous Prime: 30517

Next Prime: 30529

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 5 × 7 × 109

Divisors: 1, 2, 4, 5, 7, 8, 10, 14, 20, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 111011100111000

Octal: 73470

Duodecimal: 157B4

Hexadecimal: 7738

Square: 931470400

Square Root: 174.69974241537966

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 ∏_n>=1 (1 - x^5·n)/(1 - xⁿ)⁵ in powers of x. A277212

Convolution of natural numbers >= 2 and the partition numbers (A000041). A82775

T(n,k) = count of degree k monomials in the elementary symmetric polynomials e(μ,k) summed over all partitions μ of n. A209669

Expansion of η(q)/η(q⁵)⁵ in powers of q. A109063

Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k up steps starting at even heights. A101919

Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k up steps starting at an odd height. A101920

Number of polyhexes of class PF2 with C_2n symmetry. A30520

Number of ways to place 5 nonattacking grasshoppers on a chessboard of size n·n. A190397

Number of 8-length words w over n-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z. A213287

a(1) = 1, a(2) = 2 then the least number starting with n so that every term divides the concatenation of its neighbors. A113695