Properties of the Number 74844

Seventy-Four Thousand Eight Hundred Forty-Four

Basics

Value: 74843 → 74844 → 74845

Parity: even

Prime: No

Previous Prime: 74843

Next Prime: 74857

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ⁵ × 7 × 11

Divisors: 1, 2, 3, 4, 6, 7, 9, 11, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10010010001011100

Octal: 222134

Duodecimal: 37390

Hexadecimal: 1245c

Square: 5601624336

Square Root: 273.57631476427196

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 non-equivalent ways to choose two points in an equilateral triangle grid of side n. A227327

Number T(n,k) of partitions of an n-set with distinct block sizes and maximal block size equal to k; triangle T(n,k), n>=0, ceiling((sqrt(1+8·n)-1)/2)<=k<=n, read by rows. A262072

Expansion of b(q) / a(q) in powers of q of cubic AGM θ function. A115784

Number T(n,k) of partitions of an n-set with distinct block sizes and maximal block size equal to k; triangle T(n,k), k>=0, k<=n<=k*(k+1)/2, read by columns. A262078

Number of set partitions of [2n] with distinct block sizes and one of the block sizes is n. A328156

Irregular triangle (an infinite binary tree) read by rows. The tree has root node 1 in row n = 1. For n > 1, each node with value m in row n-1 has a left child with value m / n if n divides m, and a right child with value m·n. A360298

Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k nonroot branch nodes. A101431

O.g.f. A(x) satisfies: [xⁿ] exp(-n³*A(x)) / (1 - n·x)^n² = 0, for n > 0. A320668

Triangle read by rows: T(n,k) = (-1)^k*3^n-1-2k*binomial(n-k,k)*(4n-5k)/(n-k) (0 <= k <= floor(n/2), n >= 1). A104063

Largest difference between consecutive divisors of n is equal to the sum of divisors of n except 1 and n. A74844