Properties of the Number 11806

Eleven Thousand Eight Hundred Six

Basics

Value: 11805 → 11806 → 11807

Parity: even

Prime: No

Previous Prime: 11801

Next Prime: 11807

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5903

Divisors: 1, 2, 5903, 11806

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10111000011110

Octal: 27036

Duodecimal: 69BA

Hexadecimal: 2e1e

Square: 139381636

Square Root: 108.65541864076545

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

A self-"read and extend" sequence built following the rules given in the Comments section. A316749

a(n) = number of subsets of {1, 2, ..., n} that represent the first k divisors of m for some positive integers m and 1 <= k <= A000005(m). A378314

a(n) = ∑_k=0..n 8^k * binomial(2·n+1,n-k). A386957

Matrix inverse of triangle A122176, where A122176(n,k) = C( k*(k+1)/2 + n-k + 1, n-k) for n>=k>=0. A121436

Number of isosceles triangles, distinct up to congruence, on a centered hexagonal grid of size n. A241237

Expansion of ∏_k>=1 (1 + x^k)^2·k-1!!. A305869

a(n) = ∑_{1 <= x₁ <= x₂ <= x₃ <= x₄ <= x₅ <= x₆ <= x₇ <= n} gcd(x₁, x₂, x₃ , x₄, x₅, x₆, x₇, n). A343521

For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u·x+v·y with u,v minimal; a(n) = sum of the values of |u|. A345432

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 100 ones. A31868

a(n) = floor(n(n-1)(n-2)(n-3)/18). A11928