Properties of the Number -105056

One Hundred Five Thousand Fifty-Six

Basics

Value: -105057 → -105056 → -105055

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁵ × 7 ² × 67

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 32, 49

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11001101001100000

Octal: -315140

Duodecimal: -50968

Hexadecimal: -19a60

Square: 11036763136

Square Root: 324.1234332781263

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

Coefficients of generalized factorial polynomials p(x, n) = (x/a - (n-1))*p(x, n-1) with p(x, 0) = 1, p(x, 1) = x/a and a = 1/2. Triangle read by rows, for n >= 0 and 0 <= k <= n. A137312

T(n, k) = Stirling1(n+1, k) - Stirling1(n, k-1), for 1 <= k <= n. Triangle read by rows. A94485

Triangle read by rows: T(n,k) = S1(n,k)*2^k, where S1(n,k) is an unsigned Stirling number of the first kind (cf. A008275) (n >= 1, 1 <= k <= n). A125553

Numbers k such that A372692(k) = A372692(k+1) > 1. A372693

Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m·x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m·x and m = 2. Triangle read by rows, for n >= 0 and 0 <= k <= n. A137320

Triangle T(n, k) = coefficients of (n+1)!*(binomial(x+n+1, n+1) - binomial(x, n+1)), read by rows. A178126