Properties of the Number 4197

Four Thousand One Hundred Ninety-Seven

Basics

Value: 4196 → 4197 → 4198

Parity: odd

Prime: No

Previous Prime: 4177

Next Prime: 4201

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 1399

Divisors: 1, 3, 1399, 4197

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1000001100101

Octal: 10145

Duodecimal: 2519

Hexadecimal: 1065

Square: 17614809

Square Root: 64.78425734698207

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

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals: A(n,k) = [x^n²] theta₃(x)^k/(1 - x), where theta₃() is the Jacobi θ function. A302997

Number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton (same as A160410, but a(1) = 1, not 4). A160414

a(1) = 9; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A46259

Positive numbers whose product of digits is 12 times their sum. A62045

Partial sums of A000141. A175361

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

Relative of Hofstadter Q-sequence: a(n) = max(0, n+2087) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0. A373235

Number of points in Z⁶ of norm <= n. A55412

In base 2: smallest integer which requires n 'Reverse and Add' steps to reach a palindrome. A66058

Number of integer partitions of n whose unsigned differences have a different GCD than the GCD of their parts all minus 1. A328163