Properties of the Number 16885

Sixteen Thousand Eight Hundred Eighty-Five

Basics

Value: 16884 → 16885 → 16886

Parity: odd

Prime: No

Previous Prime: 16883

Next Prime: 16889

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 11 × 307

Divisors: 1, 5, 11, 55, 307, 1535, 3377, 16885

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100000111110101

Octal: 40765

Duodecimal: 9931

Hexadecimal: 41f5

Square: 285103225

Square Root: 129.94229488507582

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 n-node labeled acyclic digraphs with 1 out-point. A3025

Prime(a(n)) + ... + prime(a(n)+3) is a square = A051395(n)². A72849

Triangle read by rows: T(n,k) = number of labeled acyclic digraphs with n nodes, containing exactly n+1-k points of in-degree zero (n >= 1, 1<=k<=n). A58876

a(0)=1, a(1)=1, a(n)=7·a(n/2) for n=2,4,6,..., a(n)=6·a((n-1)/2)+a((n+1)/2) for n=3,5,7,.... A116522

Number of (w,x,y,z) with all terms in {1,...,n} and 3·w = x+y+z. A212069

Principal diagonal of the convolution array A213841. A213842

Convolution of A006068 (inverse of Gray code) with itself: a(n) = ∑_k=1..n+1 A006068(k) * A006068(1+n-k). A268721

a(n) = n·a(n-1) + n^{1+n mod 2}, a(0) = 1. A344317

Triangular array read by rows. T(n,k) is the number of labeled directed acyclic graphs on [n] with exactly k nodes of indegree 0. A361718

Coordination sequence for MgNi2, Position Mg2. A9935