Properties of the Number 19976

Nineteen Thousand Nine Hundred Seventy-Six

Basics

Value: 19975 → 19976 → 19977

Parity: even

Prime: No

Previous Prime: 19973

Next Prime: 19979

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 11 × 227

Divisors: 1, 2, 4, 8, 11, 22, 44, 88, 227, 454

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111000001000

Octal: 47010

Duodecimal: B688

Hexadecimal: 4e08

Square: 399040576

Square Root: 141.33647795243803

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

Number of integer partitions of n that cannot be partitioned into constant multisets with distinct block-sums. A381717

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero. A206010

Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j³+k³, ordered by increasing i; sequence gives k values. A54207

Number of nX1 0..3 arrays with every row and column least squares fitting to a zero slope straight line, with a single point array taken as having zero slope. A223819

Triangle read by rows: T(n,k) is the number of achiral combinatorial maps with n edges and k vertices, 1 <= k <= n + 1. A380617

A triangular sequence of eight back recursive polynomials that are Hermite H(x,n) like and alternating orthogonal on domain {-Infinity,Infinity} and weight function Exp[ -x²/2]:k=8 P(x, n) = Sum[If[Mod[m, 2] == 1, (m + 1)*x^m*P(x, n - m), n^m/2*P(x, n - m)], {m, 1, k}]. A138094

Number of (n+1) X 2 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to one, and every 2 X 2 determinant nonzero. A206003

Number of (n+1)X8 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero. A206009

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 33", based on the 5-celled von Neumann neighborhood. A269812

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 865", based on the 5-celled von Neumann neighborhood. A273701