Properties of the Number 18205

Eighteen Thousand Two Hundred Five

Basics

Value: 18204 → 18205 → 18206

Parity: odd

Prime: No

Previous Prime: 18199

Next Prime: 18211

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 5 × 11 × 331

Divisors: 1, 5, 11, 55, 331, 1655, 3641, 18205

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100011100011101

Octal: 43435

Duodecimal: A651

Hexadecimal: 471d

Square: 331422025

Square Root: 134.92590559266222

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

Partitioning integers to avoid arithmetic progressions of length 3. A6999

T(n,k)=Number of nXk binary arrays with row sums nondecreasing and columns lexicographically nondecreasing. A267245

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..k+1} nondecreasing, and column sums sum{i²*x(i,j), i=1..n+1} nondecreasing. A233301

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A300427

Number of length 6 walks on an n-dimensional hypercubic lattice starting and finishing at the origin and staying in the nonnegative part. A64046

Number of (3+1)X(n+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i²*x(i,j), i=1..3+1} nondecreasing. A233303

a(n) = number of permutations of (1,2,...,n) producible by an ordered triple of distinct transpositions. A253171

Solutions to a certain congruence. A275880

a(n) = (1/7)*∑_k=0..n binomial(n,k)*Fibonacci(k)*7^k. A87584

Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: (1/2) times number of linearly inducible orderings of n points in k-dimensional Euclidean space. A87644