Properties of the Number -7868

Eight Hundred Sixty-Eight

Basics

Value: -7869 → -7868 → -7867

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 7 × 281

Divisors: 1, 2, 4, 7, 14, 28, 281, 562, 1124, 1967

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1111010111100

Octal: -17274

Duodecimal: -4678

Hexadecimal: -1ebc

Square: 61905424

Square Root: 88.70174744614674

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

Expansion of ∏_k>=0 1/(1 + x^3·k+2)^3·k+2. A285310

Expansion of g.f.: 1/(∑_{p odd prime} x^p)² (even powers only). A351317

Number of partitions of n into parts of 3 kinds. A716

T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or three plus the sum of the elements diagonally to its northwest, modulo 4. A240192

T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo (k+1). A207100

Numbers n such that uphi(n) = uphi(n+1), where uphi(n) is the unitary totient function (A047994). A287055

a(n) = ∑_k=1..n-1 k*σ(k)*σ(n-k). A441

T(n,k)=Number of nXk binary arrays without the pattern 0 1 0 vertically or horizontally. A188774

Numbers k such that A206369(k) = A206369(k + 1). A206368

Numbers k such that iphi(k) = iphi(k+1), where iphi(k) is an infinitary analog to the Euler totient function (A091732). A326403