Properties of the Number -409114

Four Hundred Nine Thousand One Hundred Fourteen

Basics

Value: -409115 → -409114 → -409113

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 204557

Divisors: 1, 2, 204557, 409114

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1100011111000011010

Octal: -1437032

Duodecimal: -17890A

Hexadecimal: -63e1a

Square: 167374264996

Square Root: 639.6201998061036

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

This table (read by rows) shows the coefficients of sum formulas of n-th subfactorial numbers (A000166). The n-th row (n>=1) contains T(i,n) for i=1 to n, where T(i,n) satisfies Subf(n) = ∑_i=1..n T(i,n) * n^n-i. A101559

Left factorials: !n = ∑_k=0..n-1 k!. A3422

Rectangular table, read by antidiagonals, defined by the following rule: start with all 1's in row zero; from then on, row n+1 equals the partial sums of row n excluding terms in columns k = m*(m+1)/2 (m>=1). A127054

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k as the last entry in the first block (1<=k<=n). A177263

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k as the first entry in the last block (1<=k<=n). A177264

Triangle read by rows, T(n,k) = !n + (k-1)*(n-1)!, with n>=1, 1<=k<=n; Position of the first n-letter permutation beginning with number k in the list of lexicographically sorted permutations A030299. A237450

Triangle read by rows: T(n,k) = (∑_i=k..n i!)/(k!) for 0 <= k <= n. A348482

Triangle read by rows: T(n, k) = ∑_j=0..n j! * binomial(n - j, n - k). A361042