Properties of the Number 11682

Eleven Thousand Six Hundred Eighty-Two

Basics

Value: 11681 → 11682 → 11683

Parity: even

Prime: No

Previous Prime: 11681

Next Prime: 11689

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 11 × 59

Divisors: 1, 2, 3, 6, 9, 11, 18, 22, 33, 59

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10110110100010

Octal: 26642

Duodecimal: 6916

Hexadecimal: 2da2

Square: 136469124

Square Root: 108.08330120791094

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

Consider the Diophantine equation x³ + y³ = z³ + 1 (1 < x < y < z) or 'Fermat near misses'. Sequence gives values of z in monotonic increasing order. A50791

Let f(k) = exp(π*sqrt(k)); sequence gives numbers k such that ceiling(f(k)) - f(k) < 1/10³. A127022

Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways. A13583

Split positive integers into extending even groups and sum: 1+2, 3+4+5+6, 7+8+9+10+11+12, 13+14+15+16+17+18+19+20, ... A61317

Row sums of the triangular array A246694. A246695

Subsequence of 'Fermat near misses' which is generated by a simple formula based on the cubic binomial expansion along with formulas for the corresponding terms in the expression, x³ + y³ = z³ + 1. A141326

G.f. satisfies: A(x) = 1 + ∑_n>=1 xⁿ⁺¹ * A(x)ⁿ/(1 - x·A(x)^2·n). A192405

Triangle read by rows: T(n,k) is the number of unoriented colorings of the edges of a regular n-D orthotope (or ridges of a regular n-D orthoplex) using exactly k colors. Row n has n·2^n-1 columns. A338143

Triangle read by rows: T(n,k) is the number of unoriented colorings of the edges of a regular n-D orthoplex (or ridges of a regular n-D orthotope) using exactly k colors. Row 1 has 1 column; row n>1 has 2·n*(n-1) columns. A338147

Twice 13-gonal numbers: a(n) = n*(11·n - 9). A152997