Properties of the Number 14943

Fourteen Thousand Nine Hundred Forty-Three

Basics

Value: 14942 → 14943 → 14944

Parity: odd

Prime: No

Previous Prime: 14939

Next Prime: 14947

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 17 × 293

Divisors: 1, 3, 17, 51, 293, 879, 4981, 14943

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101001011111

Octal: 35137

Duodecimal: 8793

Hexadecimal: 3a5f

Square: 223293249

Square Root: 122.24156412611875

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 partitions of n having no more odd than even parts. A171966

INVERT transform (with offset) of triple factorials (A008544), where g.f. satisfies: A(x) = 1 + x*[d/dx x·A(x)³]/A(x)³. A112936

a(n) = (n³)/2 + (3·n²)/2 + 3·n + 3. A127873

Matrix cube of triangle A107876; equals the product of triangular matrices: A107876³ = A107862^-1·A107873. A107884

Column 1 of triangle A107884. A107886

Matrix inverse of triangle A122176, where A122176(n,k) = C( k*(k+1)/2 + n-k + 1, n-k) for n>=k>=0. A121436

Number of distinct lines passing through at least three points in a triangular grid of side n. A234248

Square table, read by antidiagonals: the g.f. for row n is given recursively by (3·n-1)*x·R(n,x) = 1 + (3·n-4)*x - 1/R(n-1,x) for n >= 1 with the initial value R(0,x) = ∑_{k >= 0} A112936(k+1)*x^k. A355793

Number of Grand Motzkin paths of length n with no zigzags, that is with no factors UDU and DUD. A78679

Apocalypse primes: 10⁶⁶⁵+a(n) has 666 decimal digits and is prime. A115983