Properties of the Number 81200

Eighty-One Thousand Two Hundred

Basics

Value: 81199 → 81200 → 81201

Parity: even

Prime: No

Previous Prime: 81199

Next Prime: 81203

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ⁴ × 5 ² × 7 × 29

Divisors: 1, 2, 4, 5, 7, 8, 10, 14, 16, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10011110100110000

Octal: 236460

Duodecimal: 3ABA8

Hexadecimal: 13d30

Square: 6593440000

Square Root: 284.95613697550016

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 T(n,m) read by rows: let p(n,x) = exp(-x) * ∑_{m >= 0} (2·m + 1)ⁿ * x^m/m!; then T(n,m) = [x^m] p(n,x). A154537

T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 18. A233997

Maximization of sums of cubes of integer differences (b_[ i ]-i)³ over permutations {b_[ i ], for i-1,2,...,n} on first n integers. A49031

Number of (n+1)X(1+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 18. A233990

Number of (n+1)X(5+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 18. A233994

Number of n X 2 0..2 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards. A279866

Number of squarefree words of length n in a 7-ary alphabet, with new values 0..6 introduced in increasing order. A215073

6th binomial transform of (0,1,0,1,0,1,...), A000035. A81200

T(n,k) = Number of squarefree words of length n in a (k+1)-ary alphabet, with new values 0..k introduced in increasing order. A215075