Properties of the Number 49404

Forty-Nine Thousand Four Hundred Four

Basics

Value: 49403 → 49404 → 49405

Parity: even

Prime: No

Previous Prime: 49393

Next Prime: 49409

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 23 × 179

Divisors: 1, 2, 3, 4, 6, 12, 23, 46, 69, 92

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1100000011111100

Octal: 140374

Duodecimal: 24710

Hexadecimal: c0fc

Square: 2440755216

Square Root: 222.27010595219502

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

The sum over all bitstrings b of length n with at least two runs of the number of runs in b not immediately followed by a longer run. A208903

Numbers k such that sopfr(k + ω(k)) = sopfr(k), where sopfr(i) = A001414(i) and ω(i) = A001221(i). A187878

G.f. A(x) = ∑_n=-oo..+oo x^n² * (2 - xⁿ)ⁿ/(1 - 2·xⁿ)ⁿ. A380680

McKay-Thompson series of class 32A for Monster. A58629

Numbers whose base-4 representation contains exactly four 0's and four 3's. A45085

(-1)ⁿ * coefficient of xⁿ in 1/x-1/(1-η(x)) power series. A82531

Numbers k such that (7·10^k + 53)/3 is prime. A293683

Triangle read by rows, the Bell transform of n!*binomial(2,n) (without column 0). A49404

Square array A(n, k), n, k >= 0, read by antidiagonals; for any number n with runs in binary expansion (r_w, ..., r₀), let p(n) be the polynomial of a single indeterminate·where the coefficient of x^e is r_e for e = 0..w and otherwise 0, and let q be the inverse of p; A(n, k) = q(p(n) * p(k)). A355664