Properties of the Number -8638

Six Hundred Thirty-Eight

Basics

Value: -8639 → -8638 → -8637

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 7 × 617

Divisors: 1, 2, 7, 14, 617, 1234, 4319, 8638

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10000110111110

Octal: -20676

Duodecimal: -4BBA

Hexadecimal: -21be

Square: 74615044

Square Root: 92.94084139924708

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 planar partitions of n decreasing across rows. A3293

Number of ways to write n as an ordered sum of 6 prime powers (including 1). A341135

Number of distinct means of subsets of {1..n}, where {} has mean 0. A327474

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having exactly k entries that are midpoints of 321 patterns (0 <= k <= n-2 for n >= 2; k=0 for n=1). A145879

Positions of zeros in A165582. A165583

a(1) = 3; a(n+1) = a(n)-th composite. A22451

For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u·x+v·y with u,v minimal; a(n) = sum of the values of |v|. A345433

a(n) = 3·n³ + 2·n² + n. A67389

G.f.: A(x) = x/Series_Reversion(x·G(x)) where G(x) = ∑_n>=0 (n+1)!²*(x/2)ⁿ. A184360

Square excess of Fibonacci numbers. A190993