Properties of the Number -82508

Eighty-Two Thousand Five Hundred Eight

Basics

Value: -82509 → -82508 → -82507

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 20627

Divisors: 1, 2, 4, 20627, 41254, 82508

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10100001001001100

Octal: -241114

Duodecimal: -3B8B8

Hexadecimal: -1424c

Square: 6807570064

Square Root: 287.2420582017891

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(n) = n·a(n-1) + (n-2)*a(n-2), with a(0) = 0, a(1) = 1. A153

Triangle T(n, k), read by row, related to Euler's difference table A068106 (divide column k of A068106 by k!). A86764

Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n). A76731

Triangular array formed from successive differences of factorial numbers, then with factorials removed. A60475

Square array read by antidiagonals: A(k, n) = (-1)ⁿ⁺¹* hypergeom([k, -n+1], [], 1) for n>0 and A(k,0) = 0 (n>=0, k>=1). A247490

Array read by upwards antidiagonals: T(n,k) is the number of ways to place n persons on different seats such that each person number p, 1 <= p <= n, differs from the seat number s(p), 1 <= s(p) <= n+k, k >= 0. A336246

Triangle read by rows: T(n, k) = (∑_i=0..n-k (-1)ⁱ * binomial(n-k, i) * (n+2-i)!) * binomial(n, k) / ((k+1) * (k+2)) for 0 <= k <= n. A373050