Properties of the Number -7425

Four Hundred Twenty-Five

Basics

Value: -7426 → -7425 → -7424

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 ² × 11

Divisors: 1, 3, 5, 9, 11, 15, 25, 27, 33, 45

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -1110100000001

Octal: -16401

Duodecimal: -4369

Hexadecimal: -1d01

Square: 55130625

Square Root: 86.16843969807043

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 g.f. A(x) = ∑_n=-oo..+oo xⁿ * (i + xⁿ)^2·n, where i² = -1. A363569

Numerators of triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) is the coefficient of x^2k+1 in polynomial u_n(x), used to approximate x->sin(π*x)/π. A144846

Odd-indexed terms of the binomial transform equals 1 and the even-indexed terms of the second binomial transform equals 1. A90158

Coefficient array of numerator polynomials of o.g.f.s (rising powers) for the columns of triangle A008517 (second-order Eulerian numbers). A112692

Matrix logarithm of A008459 (squared entries of Pascal's triangle), read by rows. A101980

Odd abundant numbers (odd numbers m whose sum of divisors exceeds 2m). A5231

Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) with a(0) = a(1) = a(2) = a(3) = a(4) = 1. A322

Odd primitive abundant numbers. A6038

Number triangle T(n,k) = C(n,n-k)*C(n+1,n-k). A103371

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7. A252407