Properties of the Number 11982

Eleven Thousand Nine Hundred Eighty-Two

Basics

Value: 11981 → 11982 → 11983

Parity: even

Prime: No

Previous Prime: 11981

Next Prime: 11987

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 1997

Divisors: 1, 2, 3, 6, 1997, 3994, 5991, 11982

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111011001110

Octal: 27316

Duodecimal: 6B26

Hexadecimal: 2ece

Square: 143568324

Square Root: 109.46232228488486

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

Number of partitions of integer partitions of n where all parts have the same length. A319066

Expansion of 1/(1 - 9·x/(1 - x))^1/3. A361375

T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234564

Irregular triangle read by rows: T(n,k) is the number of sensed 3-connected planar maps with n >= 4 faces and k >= 4 vertices. A239893

a(n) = p(n)*p(n+2)-p(n+1), where p(n) is the n-th prime. A152530

Least number·such that xⁿ has n digits equal to k. Case k=4. A285451

Number of partitions of 2ⁿ into binomial coefficients C(n,k). A225860

Round(-1/n + 1/log((2n+1)/(2n-1))). A227513

a(n) is the number of binary strings of length n such that no subsequence of length 5 or less contains 4 or more ones. A125513

Number of (n+1) X (4+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234560