Properties of the Number -8738

Seven Hundred Thirty-Eight

Basics

Value: -8739 → -8738 → -8737

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 17 × 257

Divisors: 1, 2, 17, 34, 257, 514, 4369, 8738

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10001000100010

Octal: -21042

Duodecimal: -5082

Hexadecimal: -2222

Square: 76352644

Square Root: 93.47726996441435

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

Number of subset-sums of strict integer partitions of n. A365925

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) + m·f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 2, read by rows. A157208

Sum of the sizes of the Durfee squares of all partitions of n. A115995

Number of non-strict integer partitions of n that are constant or whose part multiplicities, except possibly the first and last, are all even. A349795

Determinant of the n X n matrix whose element (i,j) equals the |i-j|-th prime or if i=j, 0. A71079

Expansion of 1/((1+x)*(1-2·x)*(1+x²)). A115451

Number of equivalence classes of compositions of n where two compositions a,b are considered equivalent if the summands of a can be permuted into the summands of b with an even number of transpositions. A218004

T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings). A234712

Numbers k such that φ(k) is a perfect sixth power. A78166

Triangle T(n, k) = (m*(n-k) + 1)*T(n-1, k-1) + (m*(k-1) + 1)*T(n-1, k) + j·T(n-2, k-1), where T(n, 1) = T(n, n) = 1, m = 2, and j = 2, read by rows. A144439