ℕ atory
Play Now

Properties of the Number 17073

Seventeen Thousand Seventy-Three

Basics

Value: 17072 → 17073 → 17074

Parity: odd

Prime: No

Previous Prime: 17053

Next Prime: 17077

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 2 × 7 × 271

Divisors: 1, 3, 7, 9, 21, 63, 271, 813, 1897, 2439

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100001010110001

Octal: 41261

Duodecimal: 9A69

Hexadecimal: 42b1

Square: 291487329

Square Root: 130.6636904422954

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

Number of free polyominoes (or square animals) with n cells. A105
The squarefree dual of a multiset partition has, for each vertex, one block consisting of the indices (or positions) of the blocks containing that vertex, counted without multiplicity. Then a(n) is the number of non-isomorphic multiset partitions of weight n whose squarefree dual is strict (no repeated blocks). A319558
Irregular triangle read by rows: T(n,k) = number of k-sided polygons formed when connecting infinite lines between all vertices and all points that divide the sides of an equilateral triangle into n equal parts, for k = 3, 4, ..., maxk. A346446
Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= n). A125753
Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= 1). A125761
Expansion of (1 - x + 2·x2) / (1 - x3 + x4). A110062
Number of free polyominoes with 2n-1 cells. A210997
Array read by diagonals downwards: A(n,k) for n>=2 and k>=0 is the number of (n,k)-polyominoes. A381030
Triangle of coefficients of polynomials u(n,x) jointly generated with A209169; see the Formula section. A209168
Triangular array: For n >= 2 and 0 < k <= n - 2, T(n, k) equals the number of (unrooted) duplication trees on n gene segments that are canonical and whose leftmost visible duplication event is (k, r), for 1 <= r <= (n - k)/2. A264870