Properties of the Number -10948

Ten Thousand Nine Hundred Forty-Eight

Basics

Value: -10949 → -10948 → -10947

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 7 × 17 × 23

Divisors: 1, 2, 4, 7, 14, 17, 23, 28, 34, 46

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10101011000100

Octal: -25304

Duodecimal: -6404

Hexadecimal: -2ac4

Square: 119858704

Square Root: 104.63269087622663

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

G.f.: ∑_n=-oo..+oo x^n*(n+1/2) * C(x)^2·n-1, where C(x) = 1 + x·C(x)² is the g.f. of the Catalan numbers (A000108). A355345

Coefficient table for the minimal polynomials of s(2·l+1)² = (2·sin(π/(2·l+1)))². A232632

a(n) = Fibonacci(n) + 2. A157725

a(n) = n*(14·n - 1). A195024

Start with a single cell at coordinates (0, 0, 0), then iteratively subdivide the grid into 3 X 3 X 3 cells and remove the cells whose sum of modulo 2 coordinates is 0; a(n) is the number of cells after n iterations. A285398

Coefficients of Chebyshev polynomials. A5583

Pisot sequence L(4,5). A18910

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock equal to the number in all its horizontal and vertical neighbors. A205055

a(n) = n*(n+1)*(5·n + 4)/6. A162147

Numbers that are the sum of eight fourth powers in six or more ways. A345581