Properties of the Number 17304

Seventeen Thousand Three Hundred Four

Basics

Value: 17303 → 17304 → 17305

Parity: even

Prime: No

Previous Prime: 17299

Next Prime: 17317

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 7 × 103

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100001110011000

Octal: 41630

Duodecimal: A020

Hexadecimal: 4398

Square: 299428416

Square Root: 131.5446692192428

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) is the number of permutations of [n] having k consecutive ascending pairs (0 <= k <= n-1). A10027

Triangle of Legendre-Stirling numbers of the second kind T(n,j), n >= 1, 1 <= j <= n, read by rows. A71951

Triangle read by rows: T(n,k) is the number of permutations of [n] having k small descents (n >= 1; 0 <= k <= n-1). A small descent in a permutation (x₁,x₂,...,x_n) is a position i such that x_i - x_i+1 = 1. A123513

Number of permutations of length n within distance 5. A154654

Number of permutations of length n with 3 consecutive ascending pairs. A313

Triangle read by rows: T(n,k) = ∑_j=0..k-1 T(n,j) + ∑_j=1..n-k T(n-j,k), with T(0,0)=1 and T(n,k) = 0 for k > n. A59450

Triangle read by rows: T(n,k) is the number of trees with n leaves of exactly k colors and all non-leaf nodes having degree 3. A339650

Expansion of e.g.f. exp(-log(1 - x)³). A353344

Twice 12-gonal numbers: a(n) = 2·n*(5·n-4). A152965

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = ∑_j=0..n (k·j)!* |Stirling1(n,k·j)|/j!. A357882