Properties of the Number 16795

Sixteen Thousand Seven Hundred Ninety-Five

Basics

Value: 16794 → 16795 → 16796

Parity: odd

Prime: No

Previous Prime: 16787

Next Prime: 16811

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 3359

Divisors: 1, 5, 3359, 16795

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 100000110011011

Octal: 40633

Duodecimal: 9877

Hexadecimal: 419b

Square: 282072025

Square Root: 129.59552461408535

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

Catalan numbers - 1. A1453

Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n). A47874

Expansion of (1-8·x+21·x²-20·x³+5·x⁴)/(1-9·x+28·x²-35·x³+15·x⁴-x⁵). A211216

Triangle read by rows: the almost-Riordan array ( 1/(1-x) | 2/((1-x)*(1+sqrt(1-4·x))), (1-2·x-sqrt(1-4·x))/(2·x) ). A373744

Sum of the fifth largest parts in the partitions of n into 8 parts. A308994

9-Modular Catalan Numbers C_n,9. A261592

Number T(n,k) of set partitions of [n], where k is minimal such that for all j in [n]: j is member of block b implies b = 1 or at least one of j-1, ..., j-k is member of a block >= b-1; triangle T(n,k), n >= 0, 0 <= k <= max(floor(n/2), n-2), read by rows. A287640

Triangle read by rows: T(n,k) = number of heapable permutations of length n whose longest decreasing subsequence has length k. A390146

Dirichlet convolution of Moebius function μ(n) (A008683) with Catalan numbers (A000108). A34742

Triangle (read by rows) formed by setting all entries in the first column and in the main diagonal ((i,i) entries) to 1 and the rest of the entries by the recursion T(n, k) = T(n-1, k) + T(n, k-1). A96465