Properties of the Number 11206

Eleven Thousand Two Hundred Six

Basics

Value: 11205 → 11206 → 11207

Parity: even

Prime: No

Previous Prime: 11197

Next Prime: 11213

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 13 × 431

Divisors: 1, 2, 13, 26, 431, 862, 5603, 11206

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 10101111000110

Octal: 25706

Duodecimal: 659A

Hexadecimal: 2bc6

Square: 125574436

Square Root: 105.85839598255775

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)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 -1,-2 or 0,2. A264313

a(n) = ∑_k=0..n q(n,k) * !k, where q(n,k) = number of partitions of n into k distinct parts and !k = subfactorial of k. A331518

a(n) is the number of vertices formed by n-secting the angles of a pentagon. A335554

Shifts left under Euler transform. A38072

Number of compositions of n such that two adjacent parts are not equal modulo 4. A62202

a(n) = ∑_k=1..n F(n mod k) where F = A000045, the Fibonacci numbers. A198259

G.f.: ∑_n>=0 xⁿ * ∑_k=0..n C(n,k) * (1/(1-x)^k - 1)^k. A245465

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + n·b(n), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296294

T(n,n-4), array T as in A038792. A38794

Integers whose binary digits "1" define, if sorted into a quadrant shape whose right angle lies in a Go board corner, same colored Go stones that surely live all, but not if any stone is omitted. A166537