Properties of the Number 16867

Sixteen Thousand Eight Hundred Sixty-Seven

Basics

Value: 16866 → 16867 → 16868

Parity: odd

Prime: No

Previous Prime: 16843

Next Prime: 16871

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 101 × 167

Divisors: 1, 101, 167, 16867

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100000111100011

Octal: 40743

Duodecimal: 9917

Hexadecimal: 41e3

Square: 284495689

Square Root: 129.8730149030198

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

T(n, k) = ∑_j=k..n binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n. A46802

Triangle T(n,k) read by rows: T(n,k) is the number of length-n ascent sequences with exactly k descents. A238858

Expansion of x²/((1-3·x)*(1-2·x)²). A66810

Matula-Goebel numbers of semi-lone-child-avoiding rooted identity trees. A331963

Triangle of 2-Eulerian numbers. A144696

Triangle read by rows: T(n,k) = ∑_j=0..n binomial(n, k+j)*2^n-k-j. A112626

Irregular triangle: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 4213. 0 <= k <= A342646(n). A342840

A positive integer n is included if n, when written in binary, is made of run-lengths (lengths of runs of 0's as well as of runs of 1's) that form a permutation of some number of consecutive positive integers starting with 1. A175061

Least n-comma number: smallest nonnegative integer that occurs in the sequence S[k+1]=S[k]+10·last_digit(S[k-1])+first_digit(S[k]) for at least n different splittings a(n)=concat(S[0],S[1]). A166507

Triangular array: the fission of ((2x+1)ⁿ) by (q(n,x)), where q(n,x)=xⁿ+x^n-1+...+x+1. A193860