Properties of the Number 30128

Thirty Thousand One Hundred Twenty-Eight

Basics

Value: 30127 → 30128 → 30129

Parity: even

Prime: No

Previous Prime: 30119

Next Prime: 30133

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 7 × 269

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 56, 112

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010110110000

Octal: 72660

Duodecimal: 15528

Hexadecimal: 75b0

Square: 907696384

Square Root: 173.57419162997707

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

Numbers k such that A322582(k) <= A276086(k) <= A348507(k). A392602

Number T(n,k) of set partitions of [n] having exactly k triples (t,t+1,t+2) such that t+i is in block b+i for some b; triangle T(n,k), n>=0, 0<=k<=max(0,n-2), read by rows. A271206

a(0),...,a(3) = 1, 2, 4, 8; thereafter a(n) = a(n-1) + 2·a(n-2) + 4·a(n-3) + 8·a(n-4), n>3. A102000

Triangle of coefficients, read by rows of (2n+1) terms, where the n-th row forms a polynomial in x, P(n,x), of degree 2n and satisfies: P(n,x) = [∑_k=1..n 1/(k + x + x²)]*[∏_k=1..n (k + x + x²)]. A74248

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, -1, 1), (0, 1, -1), (1, 0, 0)}. A148100

Triangle T(n,k), read by rows n>=0 with terms k=1..3ⁿ, where row n lists the coefficients in the n-th iteration of (x+x²+x³). A166880

Triangle, read by rows, that transforms diagonals in the table of coefficients of successive iterations of x+x²+x³ (cf. A166880). A166884

Number of Steiner triple systems (STS's) on n elements. A30128

a(n) = coefficient of xⁿ in the (n-1)-th iteration of (x + x² + x³) for n>=1. A166881

a(n) = coefficient of xⁿ in the n-th iteration of (x + x² + x³) for n>=1. A166882