Properties of the Number 79810

Seventy-Nine Thousand Eight Hundred Ten

Basics

Value: 79809 → 79810 → 79811

Parity: even

Prime: No

Previous Prime: 79801

Next Prime: 79811

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 23 × 347

Divisors: 1, 2, 5, 10, 23, 46, 115, 230, 347, 694

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10011011111000010

Octal: 233702

Duodecimal: 3A22A

Hexadecimal: 137c2

Square: 6369636100

Square Root: 282.5066370901753

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

T(n,k)=Number of nXk 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, vertically or antidiagonally. A232941

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero. A305457

Number of n X 4 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, vertically or antidiagonally. A232937

Number of nX7 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, vertically or antidiagonally. A232940

Number of nX5 0..1 arrays with every element unequal to 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero. A305454

Number of nXn 0..1 arrays with every element unequal to 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero. A305453

Sums of diagonals (upward from left to right) of the triangle shown in A079809. A79810

a(n) = sum of numbers formed using the digits of next n numbers. A81993

Binary representation of the n-th iteration of the "Rule 91" elementary cellular automaton starting with a single ON (black) cell. A267041

G.f. satisfies: a(n) = [xⁿ] ( A(x)ⁿ⁺¹ + 1/A(x)ⁿ⁺¹ ) / (n+1) for n>1, with a(0)=a(1)=1. A243426