Properties of the Number -7046

Forty-Six

Basics

Value: -7047 → -7046 → -7045

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 13 × 271

Divisors: 1, 2, 13, 26, 271, 542, 3523, 7046

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1101110000110

Octal: -15606

Duodecimal: -40B2

Hexadecimal: -1b86

Square: 49646116

Square Root: 83.94045508573325

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

T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235087

Numbers k such that 2^k + 33 is prime. A247953

a(n) = coefficient of xⁿ in A(x) such that 2 = ∑_n=-oo..+oo (-1)ⁿ * x^n*(3·n-1/2) * A(x)^3·n * (1 + xⁿ*A(x)). A359914

Triangle of coefficients of polynomials v(n,x) jointly generated with A202390; see the Formula section. A208340

Number of 4-cycles in the n-polygon diagonal intersection graph. A300552

Expansion of (1/x) * Series_Reversion( x * (1-x) / (1+x³)³ ). A369268

Triangle read by rows: T(n,k) = A129178(n,k) * (n*(n-1)/2 - k). A159323

Triangle of coefficients of g.f. a*(1+x)ⁿ + b*(1-x)ⁿ⁺²*polylog(-n-1, x)/x + 2ⁿ*c*(1-x)ⁿ⁺¹*LerchPhi(x, -n, 1/2), with a = -1, b = 1, c = 1. A168523

Triangle of coefficients of polynomials v(n,x) jointly generated with A209419; see the Formula section. A209420

a(n) = ∑_{1 <= i <= j <= k <= m <= n} gcd(i,j,k,m). A344992