Properties of the Number -7420

Four Hundred Twenty

Basics

Value: -7421 → -7420 → -7419

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 5 × 7 × 53

Divisors: 1, 2, 4, 5, 7, 10, 14, 20, 28, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -1110011111100

Octal: -16374

Duodecimal: -4364

Hexadecimal: -1cfc

Square: 55056400

Square Root: 86.13942186943211

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 ∏_k>=1 (1 - x^k/(1 + x)). A307601

Expansion of f(-x) * f(-x²)⁴ / φ(x²) in powers of·where φ(), f() are Ramanujan θ functions. A275372

Numerator of Hermite(n, 7/11). A159450

A triangle sequence of polynomial coefficients:p(x,n)=Sum[Binomial[n, k]*(-x)^k*Sum[StirlingS2[n, m]*x^m, {m, 0, n - k}], {k, 0, n}]. A174859

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 two fixed points. A387

Triangle of rencontres numbers. A8291

T(n,k)=Number of length n+6 0..k arrays with no seven consecutive terms having the maximum of any three terms equal to the minimum of the remaining four terms. A249883

Four times second pentagonal numbers: a(n) = 2·n*(3·n+1). A33580