Properties of the Number 14042

Fourteen Thousand Forty-Two

Basics

Value: 14041 → 14042 → 14043

Parity: even

Prime: No

Previous Prime: 14033

Next Prime: 14051

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 7 × 17 × 59

Divisors: 1, 2, 7, 14, 17, 34, 59, 118, 119, 238

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011011011010

Octal: 33332

Duodecimal: 8162

Hexadecimal: 36da

Square: 197177764

Square Root: 118.49894514298428

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..1 arrays with every element equal to some horizontal or antidiagonal neighbor, with top left element zero. A232316

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 1 or 4. A252293

a(n) = number of steps to reach 0 when starting from k = (n³)-1 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm. A261228

a(n) = (3·n+1)*(3·n+2). A1504

Product of the n-th run of squarefree numbers. A136742

a(n) = n-1 for n <= 4, otherwise if n is even then a(n) = a(n-5)+2^n/2, and if n is odd then a(n) = a(n-1)+2^(n-3/2). A200310

a(n) = ∑_i=0..n digsum₃(i)⁴, where digsum₃(i) = A053735(i). A231505

Numbers that are both interprime and oblong. A263676

Deficient oblong numbers. A77804

Squarefree oblong numbers. A229882