Properties of the Number 16990

Sixteen Thousand Nine Hundred Ninety

Basics

Value: 16989 → 16990 → 16991

Parity: even

Prime: No

Previous Prime: 16987

Next Prime: 16993

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 1699

Divisors: 1, 2, 5, 10, 1699, 3398, 8495, 16990

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100001001011110

Octal: 41136

Duodecimal: 99BA

Hexadecimal: 425e

Square: 288660100

Square Root: 130.3456942135029

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

Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children. A94262

Number of binary vectors of length n+1 beginning with 0 and containing just 1 singleton. A6367

Number of rooted trees with 5 nodes of disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children. A5175

Number of unbalanced partitions of n: the largest part is not equal to the number of parts. A236634

Number of partitions p of n such that the m(M(p)) is a part, where m = multiplicity, M = the maximum multiplicity of the parts of p. A240538

Interprimes which are of the form s·prime, s=10. A75285

Number of (n+2) X (6+2) 0..1 arrays with no 3·3 subblock diagonal sum 1 and no antidiagonal sum 2 and no row sum 0 and no column sum 3. A255799

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 97", based on the 5-celled von Neumann neighborhood. A270154

Number of n X 2 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279735

T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279741