Properties of the Number 14342

Fourteen Thousand Three Hundred Forty-Two

Basics

Value: 14341 → 14342 → 14343

Parity: even

Prime: No

Previous Prime: 14341

Next Prime: 14347

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 71 × 101

Divisors: 1, 2, 71, 101, 142, 202, 7171, 14342

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100000000110

Octal: 34006

Duodecimal: 8372

Hexadecimal: 3806

Square: 205692964

Square Root: 119.75808949711914

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

G.f. satisfies: A(x) = ∏_n>=1 (1 + xⁿ) * (1 + x²ⁿ*A(x)). A190822

Number of partitions of n such that the (sum of all odd parts) = floor(n/2). A284609

Expansion of 1 / (1 - ∑_k>=1 μ(2·k) * log(1 - 2·x^k) / (2·k)), where μ = A008683. A329276

Number of partitions satisfying cn(2,5) <= cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5). A39871

Partial sums of near-repdigit primes A056710. A172983

Convolution of primes with themselves. A14342

Fusible numbers. A188545

Look left and tell the least frequent digit string; a(0) = 0, a(n) = concat(c,s), where c > 0 is the number of times the string s, composed of one or more digits, has appeared in a(0) to a(n-1) such that a(n) is minimal. Digit strings with leading zeros are ignored. A329818

Cardinalities of the sets of fusible numbers obtained at the consecutive steps of their construction as follows. We set S(0) = {0}. S(n+1) is obtained by adding to S(n) the sums (x+y+1)/2 for all x,y from S(n) with the property |x-y| < 1. Then, a(n) is the number of elements in S(n). A343264