Properties of the Number 16622

Sixteen Thousand Six Hundred Twenty-Two

Basics

Value: 16621 → 16622 → 16623

Parity: even

Prime: No

Previous Prime: 16619

Next Prime: 16631

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 8311

Divisors: 1, 2, 8311, 16622

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100000011101110

Octal: 40356

Duodecimal: 9752

Hexadecimal: 40ee

Square: 276290884

Square Root: 128.92633555639438

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 simple connected graphs on n unlabeled nodes with k cycles and no node a member of more than one cycle, 0 <= k <= floor(n/3). A381467

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 214", based on the 5-celled von Neumann neighborhood. A279938

Infinite sum of the natural numbers, compacted (see comments for an explanation). A336897

Numerators of continued fraction convergents to sqrt(944). A42826

Triangle read by rows of coefficients used to generate diagonals of ordered factorizations as displayed in A098348. A98384

Numbers that are not the difference of two binary palindromes (A006995). A290393

Numbers k such that the total number of digits d in the numbers from 1 to k is even for each d from 0 to 9. A380642

Number of simple connected graphs on n unlabeled nodes with exactly 2 non-overlapping cycles. A381470

Expansion of e.g.f. (exp(x)-1)²/(-2+exp(x))². A52876

a(n) = 2ⁿ + n*(n+3). A131951