Properties of the Number -10978

Ten Thousand Nine Hundred Seventy-Eight

Basics

Value: -10979 → -10978 → -10977

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 11 × 499

Divisors: 1, 2, 11, 22, 499, 998, 5489, 10978

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10101011100010

Octal: -25342

Duodecimal: -642A

Hexadecimal: -2ae2

Square: 120516484

Square Root: 104.77595143924965

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(0) = 0; for n>0, a(n) = maximal number of regions into which space can be divided by n spheres. A46127

Number of 11-regular partitions of n (no part is a multiple of 11). A328545

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

Numbers that are the sum of eight fourth powers in exactly six ways. A345838

A(n,k) for n >= k in triangular ordering, where A(n,k) is the number of compositions (ordered partitions) of n into k parts, with the first part greater than or equal to all other parts. A156042

a(n) = A027941(n) + A027941(n+6). A153466

Linear recurrence with a(n) = 3a(n-1) - a(n-2) + 2 = 4a(n-1) - 4a(n-2) + a(n-3). Full sequence for A153466. A153819

Numbers in ascending order formed by using all the digits of the next n numbers. A81991

Triangle T, read by rows, where row n of T = row n-1 of T^fibonacci(n) with appended '1' for n>=1 starting with a single '1' in row 0. A136170

Column 0 of triangle A136170. A136171