Properties of the Number -130922

One Hundred Thirty Thousand Nine Hundred Twenty-Two

Basics

Value: -130923 → -130922 → -130921

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 11 ² × 541

Divisors: 1, 2, 11, 22, 121, 242, 541, 1082, 5951, 11902

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11111111101101010

Octal: -377552

Duodecimal: -63922

Hexadecimal: -1ff6a

Square: 17140570084

Square Root: 361.8314524747676

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

Triangle of coefficients of n!*(1 - x)ⁿ*L_n(x/(1 - x)), where L_n(x) is the Laguerre polynomial. A123202

Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column. A2720

A(n,k) = n! * Laguerre(n,-k); square array A(n,k), n>=0, k>=0, read by antidiagonals. A289192

Triangle of certain generalized Bell numbers. A90210

Lower triangular matrix, read by rows: T(i,j) = number of ways i seats can be occupied by any number k (0<=k<=j<=i) of persons. A86885

Denominators of continued fraction for alternating factorial. A56953

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

Triangle read by rows: T(n,k) is the number of subpermutations of an n-set whose orbits are each of size at most k. A261763

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(x/(1-x))/(1-x)^k. A293985

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