Properties of the Number 19969

Nineteen Thousand Nine Hundred Sixty-Nine

Basics

Value: 19968 → 19969 → 19970

Parity: odd

Prime: No

Previous Prime: 19963

Next Prime: 19973

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 19 × 1051

Divisors: 1, 19, 1051, 19969

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111000000001

Octal: 47001

Duodecimal: B681

Hexadecimal: 4e01

Square: 398760961

Square Root: 141.31171218267792

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 compositions of n whose leaders of strictly increasing runs are strictly decreasing. A374689

Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)*(2·n+3)/6)*T(n-2, k-1), read by rows. A154228

a(n) is the number of primes p less than or equal to 10ⁿ such that p+2 has only prime factors congruent to -1 modulo 4. A369111

Number of compositions of n into floor((3·j)/2) kinds of j's for all j>=1. A143787

a(n) = 78·n² + 1. A158769

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 94 ones. A31862

Number of (n+1) X 7 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively. A204649

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively. A204651

Decimal expansion of tangent of 71 degrees. A19969

a(n) is the smallest prime q such that q + prime(n) is of form 10^k or 2·10^k, or 0 if no such prime exists. A382035