Properties of the Number -5005

Five

Basics

Value: -5006 → -5005 → -5004

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: Yes

Factorization: 5 × 7 × 11 × 13

Divisors: 1, 5, 7, 11, 13, 35, 55, 65, 77, 91

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1001110001101

Octal: -11615

Duodecimal: -2A91

Hexadecimal: -138d

Square: 25050025

Square Root: 70.74602462329597

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

Matrix square of Stirling-1 triangle A008275. A39814

T(n,k) are coefficients used for power series inversion (sometimes called reversion), n >= 0, k = 1..A000041(n), read by rows. A111785

Triangle of 3-restricted Stirling numbers of the first kind (T(n,k), 0 <= k <= n), read by rows. A144633

Triangle, read by rows, each row n being defined by g.f. ∏_k=1..n (k + x - k·x²), for n >= 0. A322225

Column 3 of triangle in A144633. A144638

a(n) = [xⁿ] ∏_k=1..n (k + x - k·x²), for n >= 0. A322228

T(n, k) = [x^k] ∑_k=0..n Stirling1(n, k)*FallingFactorial(x, k), triangle read by rows, for n >= 0 and 0 <= k <= n. A325872

Triangle of coefficients in polynomials for partial sums of powers, scaled to produce integers: ∑_i=1..m i^n-1 = ∑_k=1..n T(n,k)*m^k/A064538(n-1). A79618

Triangle of 3-restricted Stirling numbers of the first kind (T(n,k), 1 <= k <= n), read by rows. A144634

Numbers k such that (266·10^k + 1)/3 is prime. A269303