Properties of the Number -8070

Seventy

Basics

Value: -8071 → -8070 → -8069

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 269

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 269, 538

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1111110000110

Octal: -17606

Duodecimal: -4806

Hexadecimal: -1f86

Square: 65124900

Square Root: 89.83317872590283

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 triangle sequence of coefficients of polynomials with roots that are inverse primes: a(n)=Prime[n](a(n-1); p(x,n)=If[n == 0, 1, a[n - 1]*(x - a[n - 1])*Product[x + Prime[i], {i, 1, n - 1}]]. A144455

Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (3,n)-rectangular grid with k '1's and (3n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other. A226290

Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (6,n)-rectangular grid with k '1's and (6n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other. A228165

Number of partitions of n in which the greatest part is 10. A26816

G.f. satisfies: A(x) = (1+x) * A(x²)*A(x³)*A(x⁴)*...*A(xⁿ)*... A129373

Number of 3 X n (0,1) matrices such that each row and each column is nondecreasing or nonincreasing. A86113

Expansion of ∏_k>=1 (1 + x^2·k-1)^k. A263140

T(n,k) = coefficient of xⁿ*y^k in A(x,y) such that: x = ∑_n=-oo..+oo (-1)ⁿ * xⁿ * (y + xⁿ)ⁿ * A(x,y)ⁿ. A359720

Max_k=0..n { Number of partitions of n into exactly k parts }. A2569

Number of partitions of n into at most 10 parts. A8639