Properties of the Number -14832

Fourteen Thousand Eight Hundred Thirty-Two

Basics

Value: -14833 → -14832 → -14831

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 103

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11100111110000

Octal: -34760

Duodecimal: -8700

Hexadecimal: -39f0

Square: 219988224

Square Root: 121.78669878110664

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

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

Triangle read by rows: T(n,k) = (-1)ⁿ⁺¹ * A000166(n) + (-1)^k * A000166(k) for n >= 2 and 1 <= k <= n-1. A373966

Expansion of (1-x)/(1+2·x-2·x²+2·x³). A78055

Triangle T(n,k) of rencontres numbers (number of permutations of n elements with k fixed points). A8290

Triangle read by rows: T(n,k) = number of partial derangements, that is, the number of permutations of n distinct, ordered items in which exactly k of the items are in their natural ordered positions, for n >= 0, k = n, n-1, ..., 1, 0. A98825

Rencontres numbers: number of permutations of [n] with exactly one fixed point. A240

Triangle of rencontres numbers. A8291

G.f. A(x) satisfies: A(x) = (1 + x·A(x)⁵) / (1 - x). A349311

a(n) = 5ⁿ - 3ⁿ - 2ⁿ. A135158

T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums. A188311