Properties of the Number 17028

Seventeen Thousand Twenty-Eight

Basics

Value: 17027 → 17028 → 17029

Parity: even

Prime: No

Previous Prime: 17027

Next Prime: 17029

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 11 × 43

Divisors: 1, 2, 3, 4, 6, 9, 11, 12, 18, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100001010000100

Octal: 41204

Duodecimal: 9A30

Hexadecimal: 4284

Square: 289952784

Square Root: 130.49137902558928

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

Numbers whose binary representation traces a nonselfcrossing circuit in honeycomb lattice when its bits (from the least to the second most significant bit) are interpreted as directions to proceed at each vertex. (The most significant 1-bit is ignored). A255571

Number of 4-block ordered tricoverings of an unlabeled n-set. A60488

Triangular array read by rows: a(n, k) = sum of number of ordered factorizations of all prime signatures with n total prime factors and k distinct prime factors. A95705

Numbers k for which A306927(k) [= A001615(k)-k] is a multiple of A344705(k) [= A001615(k)-A001065(k)], and their quotient is nonnegative. A344700

dot product (n,n-1,...2,1).(3,4,...,n,1,2). A26054

Number of solid partitions of n supported on graph of cube. A3404

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having exactly k UUU's (triple rises) where U=(1,1). Rows have 1,1,1,2,3,4,5,... entries, respectively. A92107

a(n) = 9·n*(n+1). A163758

G.f. satisfies: A(x) = ∑_n>=0 xⁿ * ∑_k=0..n x^k * {[x^k] A(x)^2·n}. A249935

Numbers n such that for some m, A166133(m)=n, A166133(m+1)=n²-1, in increasing order. A256407