Properties of the Number -7796

Seven Hundred Ninety-Six

Basics

Value: -7797 → -7796 → -7795

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 1949

Divisors: 1, 2, 4, 1949, 3898, 7796

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1111001110100

Octal: -17164

Duodecimal: -4618

Hexadecimal: -1e74

Square: 60777616

Square Root: 88.29496021857646

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 strict integer partitions of 2·n with no subset summing to n. A321142

a(n) = ∑_k=0..n-3 T(n,k) * T(n,k+3), with T given by A026637. A26969

Smallest even fundamental discriminant k such that h(-k) = 2n, where h(D) is the class number of the quadratic field with discriminant D; or 0 if no such k exists. A344072

L.g.f.: ∑_n>=1 [ ∑_k>=1 kⁿ * x^k ]ⁿ / n. A276750

Let b(0)=0; b(1)=1; b(n+2)=(e^g-1/e^g)*b(n+1)+b(n). a(n)=floor(b(n)). A90427

Numbers n for which 12n+1, 12n+5, 12n+7 and 12n+11 are primes. A123985

Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 421", based on the 5-celled von Neumann neighborhood. A272049

Triangle read by rows: T(m,n) (1 <= n < m) is the number of moves of an (m,n)-leaper (a generalization of a chess knight) until it can no longer move, starting on a board with squares spirally numbered from 1. Each move is to the lowest-numbered unvisited square. T(m,n) = -1 if the path never terminates. A323749

a(n) is the smallest number that is the sum of n positive 5th powers in three ways. A343083

Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled unisolated nodes with k arcs, k = 0..n*(n-1). A350908