Properties of the Number 30218

Thirty Thousand Two Hundred Eighteen

Basics

Value: 30217 → 30218 → 30219

Parity: even

Prime: No

Previous Prime: 30211

Next Prime: 30223

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 29 × 521

Divisors: 1, 2, 29, 58, 521, 1042, 15109, 30218

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011000001010

Octal: 73012

Duodecimal: 155A2

Hexadecimal: 760a

Square: 913127524

Square Root: 173.83325343558406

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

T(n,k)=Number of nXk 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly one mistake. A278676

Number of length n+6 0..1 arrays with no seven consecutive terms having four times the sum of any three elements equal to three times the sum of the remaining four. A249190

Partial sums of A253088. A255048

a(n) = 36·n² - 2·n. A158062

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 865", based on the 5-celled von Neumann neighborhood. A273701

Number of n X 3 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly one mistake. A278671

Number of maximal cliques in the n-polygon diagonal intersection graph. A291949

Number of nX5 0..1 arrays with every element equal to 0, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A300679

Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5) + cn(2,5) and cn(0,5) <= cn(1,5) + cn(4,5) + cn(3,5). A39844

T(n,k)=Number of length n+6 0..k arrays with no seven consecutive terms having four times the sum of any three elements equal to three times the sum of the remaining four. A249197