Properties of the Number -9822

Eight Hundred Twenty-Two

Basics

Value: -9823 → -9822 → -9821

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 1637

Divisors: 1, 2, 3, 6, 1637, 3274, 4911, 9822

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10011001011110

Octal: -23136

Duodecimal: -5826

Hexadecimal: -265e

Square: 96471684

Square Root: 99.10600385445879

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

Inverse Mertens function: smallest k such that |M(k)| = n, where M(x) is Mertens's function A002321. A51402

Smallest value of·such that M(x) = -n, where M(x) is Mertens's function A002321. A51401

T(n,k)=Number of nXk 0..1 arrays with rows and antidiagonals unimodal. A223680

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not 0 1 2 7 8 or 9 and every diagonal and antidiagonal sum 0 1 2 7 8 or 9. A251983

Sphenic numbers (A007304) whose neighbors are sphenic. A248202

An inverse to Mertens's function: smallest k >= 2 such that Mertens's function |M(k)| (see A002321) is equal to n. A60434

Triangle T(n, k) = T(n, k-1) + (-1)^k*A060187(n+2,k+1) if k <= floor(n/2), otherwise T(n, n-k), with T(n, 0) = T(n, n) = 1, read by rows. A225356

Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed. A228963

Stirling transform of partitions into distinct parts (A000009). A306023

Number of nontrivial Baxter permutations of length 2n-1. A1183