Properties of the Number 11980

Eleven Thousand Nine Hundred Eighty

Basics

Value: 11979 → 11980 → 11981

Parity: even

Prime: No

Previous Prime: 11971

Next Prime: 11981

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 5 × 599

Divisors: 1, 2, 4, 5, 10, 20, 599, 1198, 2396, 2995

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111011001100

Octal: 27314

Duodecimal: 6B24

Hexadecimal: 2ecc

Square: 143520400

Square Root: 109.45318634009702

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

Coordination sequence for "tea" 3D uniform tiling. A299285

G.f. A(x) satisfies: A(x) = (1 + x·A(x)) * (1 + x²*A(x)³). A181734

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302741

a(n) = ∑_i=0..n i^{n - i}*(n - i)ⁱ. A62817

A(n, k) is the k-th number b > 1 such that b^prime(n+i-1) == 1 (mod prime(n+i)²) for each i = 0..2, with k running over the positive integers; square array, read by antidiagonals, downwards. A319060

Consider the Diophantine equation x³ + y³ = z³ + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x. A50792

a(n) = n*(15·n - 1)/2. A22272

a(n) = 1000·n - 20. A157515

a(n) = 9·11ⁿ + 1. A199763

Sum of n-th derivatives at x=1 of all functions that are representable as x^x^...^x with n x's and parentheses inserted in all possible ways. A216281