Properties of the Number 19701

Nineteen Thousand Seven Hundred One

Basics

Value: 19700 → 19701 → 19702

Parity: odd

Prime: No

Previous Prime: 19699

Next Prime: 19709

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 11 × 199

Divisors: 1, 3, 9, 11, 33, 99, 199, 597, 1791, 2189

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110011110101

Octal: 46365

Duodecimal: B499

Hexadecimal: 4cf5

Square: 388129401

Square Root: 140.360250783475

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

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally. A253495

Partial sums of A000141. A175361

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal minus antidiagonal sum nondecreasing horizontally and vertically. A253456

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00010001. A260177

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero. A304704

a(n) = 3·n*(6·n + 1). A144314

Triangular numbers T from A000217 such that (4·T+1)/5 is prime. A207339

Trajectory of 397 under the map A340008: n -> n/2 if n is even, n-> n² - 1 if n is an odd prime, otherwise n -> n - 1. A340419

Number of integer partitions of n not containing more ones than any other part. A381544

a(n) = (4·n³ - 6·n² + 14·n + 3)/3. A321124