Properties of the Number -79968

Seventy-Nine Thousand Nine Hundred Sixty-Eight

Basics

Value: -79969 → -79968 → -79967

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 39

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 7 ² × 17

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 16

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -10011100001100000

Octal: -234140

Duodecimal: -3A340

Hexadecimal: -13860

Square: 6394881024

Square Root: 282.7861382741382

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

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(1,1), d=(1,-2) and have k peaks (i.e., ud's). A108767

T(n,k)=Number of 0..2 colorings of an nx(k+1) array circular in the k+1 direction with new values 0..2 introduced in row major order. A214101

The curvature (rounded down) of touching circles inscribed in a special way in the smaller segment of circle of radius 10/9 divided by a chord of length 4/3. A247512

Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k middle edges (n >= 0, k >= 0). A120986

Triangle read by rows: T(n,k) = binomial(n+1,k+1) * binomial(4·n-3·k+1,k) / (n+1), 0<=k<=n. A391047

Numbers n such that n=φ(φ(n)+σ(n)) and n is not of the form 2·p where p is a Sophie Germain odd prime. A97652

Number of 0..2 colorings on an n X 7 array circular in the 7 direction with new values 0..2 introduced in row major order. A214099

Number of 0..2 colorings of a 4X(n+1) array circular in the n+1 direction with new values 0..2 introduced in row major order. A214103

T(n, k) = binomial(n - k - 1, k)*binomial(2·n - 2·k, n)/(n + 1), for n >= 1 and 0 <= k <= floor((n - 1)/2), triangle read by rows. A319120

Triangle read by rows: T(n, k) = A358125(n,k)*binomial(n-1, k), 0 <= k <= n-1. A359200