Properties of the Number 19107

Nineteen Thousand One Hundred Seven

Basics

Value: 19106 → 19107 → 19108

Parity: odd

Prime: No

Previous Prime: 19087

Next Prime: 19121

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 11 × 193

Divisors: 1, 3, 9, 11, 33, 99, 193, 579, 1737, 2123

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 100101010100011

Octal: 45243

Duodecimal: B083

Hexadecimal: 4aa3

Square: 365077449

Square Root: 138.2280724020993

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 (1,0) steps in all paths of length n with steps U=(1,1), D=(1,-1) and H=(1,0), starting at (0,0), staying weakly above the x-axis (i.e., in all length-n left factors of Motzkin paths). A132894

Numbers k such that A206369(k) = A206369(k + 1). A206368

Number T(n,k) of n-step walks on cubic lattice starting at (0,0,0), ending at (0,k,n-k) and using steps (0,0,1), (0,1,0), (1,0,0), (-1,1,1), (1,-1,1), and (1,1,-1); triangle T(n,k), n>=0, 0<=k<=n, read by rows. A328347

a(n) = (6 + 10·n + 5·n² + n³)/2. A164845

Triangle T, read by rows : T(n,k) = A007318(n,k)*A005773(n+1-k). A171651

Positions of the flipped bits (here they are always set from 0 to 1) in the sequence A059661. A59662

Expansion of 1 / ((1-x-x²-x³)*(1-x-x³)). A103321

A156977/3. A164565

Number of nX3 0..1 arrays with every element equal to 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299569

Triangle read by rows: T(n,m) = ∑_i=1..n C(n,i-m)*C(n+m-i,i-1)*C(n+m-i,m)/n, with T(0,0)=1. A337991