Properties of the Number 30296

Thirty Thousand Two Hundred Ninety-Six

Basics

Value: 30295 → 30296 → 30297

Parity: even

Prime: No

Previous Prime: 30293

Next Prime: 30307

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 7 × 541

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 541, 1082

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011001011000

Octal: 73130

Duodecimal: 15648

Hexadecimal: 7658

Square: 917847616

Square Root: 174.05746177627663

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 read by rows, T(n, k) = binomial(n, k) * ∑_j=0..n-k E(n-k, j)*2^j, where E(n, k) are the Eulerian numbers A173018(n, k), for 0 <= k <= n. A154921

Numbers k which have a factorization k = f1·f2*...*fr where the digits of {k, f1, f2, ..., fr} together give 0,1,...,9 exactly once. A370970

Triangle relating to ordered Bell numbers, A000670. A208744

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

Triangle read by rows: T(n,k) is the number of labeled loop-threshold graphs on vertex set [n] with k components, for n >= 1 and 1 <= k <= n. A350531

a(0) = 1; a(n) = ∑_k=0..n-1 binomial(n+3,k+3) * a(k). A352863

Numbers k which have a factorization k = f₁*f₂*...*f_r where f_i >= 1 and the digits of {k, f₁, f₂, ..., f_r} together give 0,1,...,9 exactly once. A372259

Smallest start for a run of at least n composite numbers. A30296