Properties of the Number -111645

One Hundred Eleven Thousand Six Hundred Forty-Five

Basics

Value: -111646 → -111645 → -111644

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 × 827

Divisors: 1, 3, 5, 9, 15, 27, 45, 135, 827, 2481

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11011010000011101

Octal: -332035

Duodecimal: -54739

Hexadecimal: -1b41d

Square: 12464606025

Square Root: 334.1332069699149

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

Expansion of exp( ∑_n>=1 -sigma₁₀(n)*xⁿ/n ) in powers of x. A283340

Number of monotone Boolean functions of n variables with 2 mincuts. Also number of Sperner systems with 2 blocks. A16269

Triangle read by rows: 2-Stirling numbers of the second kind. A143494

Triangle read by rows: T(n,k) = number of forests of k labeled rooted trees of height at most 1, with n labels, where any root may contain >= 1 labels, n >= 0, 0 <= k <= n. A143395

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k up-down runs (1 <= k <= n). A186370

Triangle read by rows: matrix product of the Stirling numbers of the second kind with the binomial coefficients. A126351

The function W_n(6) (see Borwein et al. reference for definition). A169711

a(n) = (2·n - 1)*(24·n² - 42·n + 19). A160174

Square array A(n, k) = ((k+2)ⁿ⁺² - 2 * (k+1)ⁿ⁺² + kⁿ⁺²)/2 for k, n >= 0 read by ascending antidiagonals. A372118

Triangle read by rows: T(n, k) = number of k-element subobjects of an n-element set in the category of relations, n >= 0, 0 <= k <= n. A373398