Properties of the Number -26197

Twenty-Six Thousand One Hundred Ninety-Seven

Basics

Value: -26198 → -26197 → -26196

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 17 × 23 × 67

Divisors: 1, 17, 23, 67, 391, 1139, 1541, 26197

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110011001010101

Octal: -63125

Duodecimal: -131B1

Hexadecimal: -6655

Square: 686282809

Square Root: 161.85487326614543

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

At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage. A56640

G.f.: (x+4·x³+x⁵)/((1-x)²*(1-x²)²*(1-x³)). A83707

Number of squares in the interior of the square with vertices (n,0), (0,n), (-n,0) and (0,-n) in a square (x,y)-grid. A111746

Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code. A30504

G.f. A(x) satisfies A(x) = 1 + x/A(x)² * (1 - A(x) + A(x)⁴). A377458

Expansion of g.f. 1/((1 - 2·x)*(1 - 7·x)*(1 - 9·x)). A16312

Largest proper divisor of the n-th Carmichael number (A002997). A81703

Integers k such that for all m>k, d(m)/m < d(k)/k where d(j) = Min_{p & q odd primes, 2·j = p+q, p <= q} (q-p)/2. A335297

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 0, 1), (0, 1, -1), (1, 1, -1)}. A148887