Properties of the Number -40321

Forty Thousand Three Hundred Twenty-One

Basics

Value: -40322 → -40321 → -40320

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 61 × 661

Divisors: 1, 61, 661, 40321

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001110110000001

Octal: -116601

Duodecimal: -1B401

Hexadecimal: -9d81

Square: 1625783041

Square Root: 200.80089641234176

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

a(n) = n! + 1. A38507

Sum of factorials of the digits of n. A61602

a(1) = 0, a(n) = (e1·i1! + e2·i2! + ... + ez·iz!) for n = prime(i1)^e1 * prime(i2)^e2 * ... * prime(iz)^ez, where prime(k) is the k-th prime, A000040(k). A276075

Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component or all components by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals. A229142

Sums of nonconsecutive factorial numbers. A60112

T(n,k)=Number of nXk 0..1 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..1 order. A222290

a(n) is the least semiprime > n!. A89539

a(n) = (n!+9)/9. A139156

Number of nonisomorphic unfoldings of the n-th Johnson solid. A343210

Triangle T(n,k) read by rows: T(0,k)=1, otherwise T(n,k)= 1 + floor(n!*exp(-(k-floor(n)/2)²)). A171229