Properties of the Number 74484

Seventy-Four Thousand Four Hundred Eighty-Four

Basics

Value: 74483 → 74484 → 74485

Parity: even

Prime: No

Previous Prime: 74471

Next Prime: 74489

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 2069

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 2069

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10010001011110100

Octal: 221364

Duodecimal: 37130

Hexadecimal: 122f4

Square: 5547866256

Square Root: 272.9175699730598

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

Expansion of ∏_m>=1 (1 + q^m)^m; number of partitions of n into distinct parts, where n different parts of size n are available. A26007

Place n points in general position on each side of an equilateral triangle, and join every pair of the 3·n+3 boundary points by a chord; sequence gives number of edges in the resulting planar graph. A367119

Number of self-avoiding walks of length n on hypertriangular lattice. A46945

E.g.f. equals the series reversion of x + x·log(1-x). A52819

Sum of squares of parts of the partitions of 2n into two squarefree parts. A280316

Triangle, read by rows, where row n equals the inverse binomial transform of column n in the rectangular table A124460. A124469

Multiplicity of highest weight (or singular) vectors associated with character chi₉₂ of Monster module. A34480

Triangle of T(n,k)=number of peakless Motzkin paths of length n containing k valleys (can be easily expressed using RNA secondary structure terminology). A89738

G.f. A(x) satisfies: [xⁿ] (1+x)⁽ⁿ⁺¹²) / A(x) = 0 for n>0. A304193

a(n) = b(A074483(n), n), where b(k) is the recursion: b(1,n)=1, b(k+1,n)=b(k,n) + (b(k,n) reduced mod(k+n)) (cf. A074482). A74484