Properties of the Number 26982

Twenty-Six Thousand Nine Hundred Eighty-Two

Basics

Value: 26981 → 26982 → 26983

Parity: even

Prime: No

Previous Prime: 26981

Next Prime: 26987

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 1499

Divisors: 1, 2, 3, 6, 9, 18, 1499, 2998, 4497, 8994

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100101100110

Octal: 64546

Duodecimal: 13746

Hexadecimal: 6966

Square: 728028324

Square Root: 164.26198586404584

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(n) is the number of numbers removed in each step of Eratosthenes's sieve for 10!. A145537

a(n) = 27·n² - 21·n + 6 (n>=1). A304164

T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors. A186488

a(n) = n XOR n³. A261807

T(n,m)=Number of (n+1)X5 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors. A189174

T(n,m)=Number of (n+1)X3 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors. A190023

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 339", based on the 5-celled von Neumann neighborhood. A271291

Unique solution·of the congruence x² = -1 (mod m(n)), with m(n) = A002559(n) (Markoff numbers) in the interval [1, floor(m(n)/2)], assuming the Markoff uniqueness conjecture, for n >= 3. A324601

Numbers whose base-4 representation contains exactly four 1's and four 2's. A45109

a(n) = ∑_k=0..n-1 T(n,k) * T(n,k+1), with T given by A026670. A26982