Properties of the Number 7242

Seven Thousand Two Hundred Forty-Two

Basics

Value: 7241 → 7242 → 7243

Parity: even

Prime: No

Previous Prime: 7237

Next Prime: 7243

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 17 × 71

Divisors: 1, 2, 3, 6, 17, 34, 51, 71, 102, 142

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1110001001010

Octal: 16112

Duodecimal: 4236

Hexadecimal: 1c4a

Square: 52446564

Square Root: 85.09994124557313

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 integer partitions of n that can be partitioned into distinct pairs of distinct parts, i.e., into a set of edges. A339560

Let A(0) = 1, B(0) = 0 and C(0) = 0. Let B(n+1) = ∑_{k = 0..n} binomial(n,k)* A(k), C(n+1) = ∑_{k = 0..n} binomial(n,k)*B(k) and A(n+1) = ∑_{k = 0..n} binomial(n,k)*C(k). This entry gives the sequence C(n). A143817

Number of certain stackings of n+1 squares on a double staircase. A55244

Coefficients in an asymptotic expansion of A259472 in falling factorials. A261239

Cascadence of (1+x)³; a triangle, read by rows of 3n+1 terms, that retains its original form upon convolving each row with [1,3,3,1] and then letting excess terms spill over from each row into the initial positions of the next row such that only 3n+1 terms remain in row n for n>=0. A120919

Abundant numbers that differ from the next abundant number by 3. A228382

Expansion of ∏_k=1..9 theta₃(q^k), where theta₃() is the Jacobi θ function. A320241

Number of permutations that are 2 "block reversals" away from 12...n. A7972

Number of ways to fill a Young diagram with positive integers summing to n such that all rows and columns are weakly increasing. A323450

Irregular table read by rows: T(n,k) is the number of k-sided polygons, for n>=1 and k>=3, in a hexagon when straight line segments connect the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the hexagon. A367665