Properties of the Number 69196

Sixty-Nine Thousand One Hundred Ninety-Six

Basics

Value: 69195 → 69196 → 69197

Parity: even

Prime: No

Previous Prime: 69193

Next Prime: 69197

Digit Sum: 31

Digital Root: 4

Palindrome: Yes

Factorization: 2 ² × 17299

Divisors: 1, 2, 4, 17299, 34598, 69196

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10000111001001100

Octal: 207114

Duodecimal: 34064

Hexadecimal: 10e4c

Square: 4788086416

Square Root: 263.05132579023433

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

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 462", based on the 5-celled von Neumann neighborhood. A288437

Largest palindromic substring in 8ⁿ. A46266

Numbers k such that the sum of the octagonal numbers O(k), O(k+1), O(k+2) and O(k+3) is equal to the hexagonal number H(m) for some m. A253120

Consecutive internal states of the linear congruential pseudo-random number generator (7141·s + 54773) mod 259200 when started at 1. A385463

Terms of A083393 such that the sum of the factorials of the digits is prime. A83394

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

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

a(1)=1, a(2)=3; for n>1, a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); and a(n+2)=a(n+1)+a(n) otherwise. A69196