Properties of the Number 42140

Forty-Two Thousand One Hundred Forty

Basics

Value: 42139 → 42140 → 42141

Parity: even

Prime: No

Previous Prime: 42139

Next Prime: 42157

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 5 × 7 ² × 43

Divisors: 1, 2, 4, 5, 7, 10, 14, 20, 28, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010010010011100

Octal: 122234

Duodecimal: 20478

Hexadecimal: a49c

Square: 1775779600

Square Root: 205.2802961806125

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

Triangle, read by rows, each row n being defined by g.f. ∏_k=1..n (k + x - k·x²), for n >= 0. A322225

Number of ordered triples (w,x,y) with all terms in {1,...,n} and w³ < x³ + y³. A211650

Numbers k such that 4^k + 31 is prime. A262971

Number of Dyck paths of semilength n such that each positive level has exactly six peaks. A288322

Binomial transform(2) of Motzkin numbers. A270561

Triangle read by rows: coefficients of polynomials arising in the spontaneous magnetization of the anisotropic square lattice Ising model (see pp. 174-5 of the Guttmann reference). A138781

Irregular triangle read by rows. T(n,k) is the number of properly colored simple labeled graphs on [n] with exactly k edges, n >= 0, 0 <= k <= binomial(n,2). A361456

a(n) = ∑_k=0..n-1 binomial(4·k+1,k) * binomial(4·n-4·k,n-k-1). A386612

a(n) = A322227(n) / (n*(n+1)/2), where A322227(n) = [x^n-1] ∏_k=1..n (k + x - k·x²), for n >= 1. A322226

a(n) = [x^n-1] ∏_k=1..n (k + x - k·x²), for n >= 1. A322227