Properties of the Number -109600

One Hundred Nine Thousand Six Hundred

Basics

Value: -109601 → -109600 → -109599

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁵ × 5 ² × 137

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 25, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11010110000100000

Octal: -326040

Duodecimal: -53514

Hexadecimal: -1ac20

Square: 12012160000

Square Root: 331.058907144937

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(n) = n*(a(n-1) + 1), a(0) = 0. A7526

Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp((1+y)*x)/(1-x). A73107

Multiply by 1, add 1, multiply by 2, add 2, etc., starting with 0. A82458

Triangle read by rows, T(n,k) = ∑_j=0..n C(n,j)*L(j,k), L the unsigned Lah numbers A271703, for n>=0 and 0<=k<=n. A271705

T(n,k) = [0<k<=n] * n*(T(n-1,k-1)+T(n-1,k)) + [k=0 and n>=0]; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. A326659

Triangle read by rows: T(i,j) for the recurrence T(i,j) = (T(i-1,j) + 1)*i. A121662

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) = n! * ∑_j=0..n j^k/j!. A337085

Array read by antidiagonals: see A128195 for details. A126062

Triangle read by rows: T(m,n) = ∑_i=1..n P(m,i) where P(m,n) = m!/(m-n)! is the number of permutations of m items taken n at a time, for 1 <= n <= m. A285268

Triangle read by rows: T(n, k) = n·k * (T(n-1, k-1) + T(n-1, k)) for k > 0 with initial values T(n, 0) = 1 and T(i, j) = 0 for j > i. A371898