Properties of the Number -7922

Nine Hundred Twenty-Two

Basics

Value: -7923 → -7922 → -7921

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 17 × 233

Divisors: 1, 2, 17, 34, 233, 466, 3961, 7922

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1111011110010

Octal: -17362

Duodecimal: -4702

Hexadecimal: -1ef2

Square: 62758084

Square Root: 89.00561780022652

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

Monotonic ordering of set S generated by these rules: if·and y are in S then x² + y² is in S, and 1 is in S. A192476

Smallest even k such that lpf(k-3) > lpf(k-1) >= prime(n), where lpf=least prime factor (A020639). A242719

Centered square numbers: a(n) = 4·n² + 4·n + 2. A69894

a(n) = prime(n)² + 1. A66872

List of different composite numbers in Pascal-like triangles with index of asymmetry y = 1 and index of obliqueness z = 0 or z = 1. A141065

a(n) = Fibonacci(n)²+1. A245306

Concatenation of n-th prime and n in decimal notation. A75110

Number of subsets of {1..n} containing n such that it is possible to choose a different binary index of each element. A370639

Smallest even k such that lpf(k-1) = prime(n), while lpf(k-3) > prime(n), where lpf=least prime factor (A020639). A242489

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 2 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 2 3 4 6 or 7. A252278