Properties of the Number 19718

Nineteen Thousand Seven Hundred Eighteen

Basics

Value: 19717 → 19718 → 19719

Parity: even

Prime: No

Previous Prime: 19717

Next Prime: 19727

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 9859

Divisors: 1, 2, 9859, 19718

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100110100000110

Octal: 46406

Duodecimal: B4B2

Hexadecimal: 4d06

Square: 388799524

Square Root: 140.42079618062277

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 subsets of {1..n} containing n but not containing the sum of any two distinct elements. A364755

Least number·such that xⁿ has n digits equal to k. Case k = 6. A285453

Pseudo-random numbers: MS C 6.0 version. A84275

Least number k not divisible by 10 such that the decimal expansion of kⁿ contains some digit exactly n times. A243151

Number of (n+2)X(n+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101. A260833

Number of n-digit biquanimous strings using digits {0,1,...,5}. A288689

Number of permutations of length n which avoid the patterns 1342, 4213. A116707

Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101. A260839

Number A(n,k) of n-digit biquanimous strings using digits {0,1,...,k}; square array A(n,k), n>=0, k>=0, read by antidiagonals. A288638

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