Properties of the Number 17916

Seventeen Thousand Nine Hundred Sixteen

Basics

Value: 17915 → 17916 → 17917

Parity: even

Prime: No

Previous Prime: 17911

Next Prime: 17921

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 1493

Divisors: 1, 2, 3, 4, 6, 12, 1493, 2986, 4479, 5972

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100010111111100

Octal: 42774

Duodecimal: A450

Hexadecimal: 45fc

Square: 320983056

Square Root: 133.85066305401702

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

G.f. A(x) defined by: A(x)³ consists entirely of integer coefficients between 1 and 3 (A083953); A(x) is the unique power series solution with A(0)=1. A84203

The 5x + 1 sequence beginning at 7. A28389

Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k valleys. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A valley is a (1,-1)-step followed by a (1,1)-step. A182900

Regular triangle where T(n,k) is the number of labeled connected multigraphs with loops with n edges and k vertices. A322148

5x + 1 sequence beginning at 11. A259193

Spin-spin correlation function for D₄ lattice. A10565

Numbers n such that d(n-2) = d(n) = d(n+2) = 12 where d(n)=A000005(n). A190645

Number of 5-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first differences in -n..n. A209033

Number of length 3+2 0..n arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero. A250322

Start with 1, apply 1->12, 21->21, 22->21, 2->2 (for final 2); a(n) = length of n-th term. A13950