Properties of the Number 79008

Seventy-Nine Thousand Eight

Basics

Value: 79007 → 79008 → 79009

Parity: even

Prime: No

Previous Prime: 78989

Next Prime: 79031

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁵ × 3 × 823

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10011010010100000

Octal: 232240

Duodecimal: 39880

Hexadecimal: 134a0

Square: 6242264064

Square Root: 281.0836174521738

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

a(0)=1; a(1)=0; a(n) = 2*(n-1)*(a(n-1) + a(n-2)). A53871

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0. A264945

Triangle read by rows: T(n, k) = number of matchings of 2n people with partners (of either sex) such that exactly k couples are left together. A55140

Number A(n,k) of partitions of [k·n] into n sets of size k having no set of consecutive numbers whose maximum (if k>0) is a multiple of k; square array A(n,k), n>=0, k>=0, read by antidiagonals. A370366

Expansion of (theta₃(z⁴)³ + theta₂(z⁴)³)⁴. A28697

Number of 3-step one or two space at a time rook's tours on an n X n board summed over all starting positions. A187288

Number of 2 X 2 matrices having entries in {0,1,...,n} and determinant in the closed interval [-n,n] with no entry repeated. A279063

Number of 7Xn arrays containing n copies of 0..7-1 with no equal horizontal neighbors and new values introduced sequentially from 0. A264950

Triangle read by rows: T(n, k) = (T(n-1, k-1) + T(n-1, k)) * 2·n with initial values T(n, 0) = ∑_i=0..n (-1)^n-i * binomial(n, i) * A001147(i) and T(i, j) = 0 if j > i. A372260

a(n) is smallest number k such that the n successive values of φ(k+j) (j=0,..,n-1) are all distinct. A79008