Properties of the Number 17722

Seventeen Thousand Seven Hundred Twenty-Two

Basics

Value: 17721 → 17722 → 17723

Parity: even

Prime: No

Previous Prime: 17713

Next Prime: 17729

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 8861

Divisors: 1, 2, 8861, 17722

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100010100111010

Octal: 42472

Duodecimal: A30A

Hexadecimal: 453a

Square: 314069284

Square Root: 133.12400234367956

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

Set partitions without singletons: number of partitions of an n-set into blocks of size > 1. Also number of cyclically spaced (or feasible) partitions. A296

Triangle read by rows: T(n,k) is the number of partitions of an n-set having k singleton blocks (0<=k<=n). A124323

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. exp(exp(x) - ∑_i=0..k xⁱ/i!). A293024

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k cycles that are either nonincreasing or of length 1 (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... . A186759

Triangle read by rows, arising in enumeration of permutations by cyclic peaks, cycles and fixed points. A216963

Number T(n,k) of set partitions of [n] such that at least one of the block sizes is k or k=0; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A327884

Number of set partitions B'_t(n) of {1,2,...,t} into at most n parts, so that no part contains both 1 and t, or both i and i+1 with 1 <= i < t; triangle B'_t(n), t>=0, 0<=n<=t, read by rows. A261137

T(n,k) counts the set partitions of n containing k-1 blocks of length 1. A86659

Triangle read by rows: T(n,k) = number of partitions of n with k circular successions (n>=0, 0 <= k <= n). A250104

Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} in which the shortest block has length k (1 <= k <= n). A178979