Properties of the Number 17130

Seventeen Thousand One Hundred Thirty

Basics

Value: 17129 → 17130 → 17131

Parity: even

Prime: No

Previous Prime: 17123

Next Prime: 17137

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 571

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 571, 1142

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100001011101010

Octal: 41352

Duodecimal: 9AB6

Hexadecimal: 42ea

Square: 293436900

Square Root: 130.8816259067712

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

a(n) is such that the a(n)-th composite number is (n-th prime)². A120389

Number of partitions p of n such that mean(p) > multiplicity(max(p)). A240202

a(1)=2; for n > 1, a(n) is the largest number <= 2·a(n-1) divisible by n. A178901

Sum of distinct products i·j*k with 1 <= i, j, k <= n. A323334

a(n)² is the least square with exactly n 1's in base n. A342546

Expansion of -1/((1 - x)*(1 - x² + 4·x³)). A175714

Maximal sum of x0 + x0·x1 + ... + x0·x1*...*xk over all compositions x0 + ... + xk = n. A239288

The number of Hamiltonian cycles with rotational symmetry of order 3 on the triangular grid, n vertices on each side. A379747

a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...). A24479

Number of nonempty subsets of {1,2,...,n} in which exactly 2/3 of the elements are <= sqrt(n). A48095