Properties of the Number -79209

Seventy-Nine Thousand Two Hundred Nine

Basics

Value: -79210 → -79209 → -79208

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 13 × 677

Divisors: 1, 3, 9, 13, 39, 117, 677, 2031, 6093, 8801

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10011010101101001

Octal: -232551

Duodecimal: -39A09

Hexadecimal: -13569

Square: 6274065681

Square Root: 281.44093518889537

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

Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of comparisons required to find j in step L2.2'. A79750

Triangle read by rows: T(i,j) for the recurrence T(i,j) = (T(i-1,j) + 1)*i. A121662

Triangle read by rows: T(m,n) = ∑_i=1..n P(m,i) where P(m,n) = m!/(m-n)! is the number of permutations of m items taken n at a time, for 1 <= n <= m. A285268

Numerators of continued fraction convergents to sqrt(381). A41722

Expansion of H(x)*(1+x⁵)/(1-x²-x³-x⁴) where H(x) = g.f. for A249665. A337654

Let a(0)=1. Then a(n) = sums of consecutive strings of positive integers of length 3·n, starting with the integer 2. A289721