Properties of the Number 49104

Forty-Nine Thousand One Hundred Four

Basics

Value: 49103 → 49104 → 49105

Parity: even

Prime: No

Previous Prime: 49103

Next Prime: 49109

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 11 × 31

Divisors: 1, 2, 3, 4, 6, 8, 9, 11, 12, 16

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111111010000

Octal: 137720

Duodecimal: 24500

Hexadecimal: bfd0

Square: 2411202816

Square Root: 221.59422375143265

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

a(n) = (Fibonacci(6·n+3) - 2)/4. A53606

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no 2X2 subblock having the minimum of its diagonal elements less than the absolute difference of its antidiagonal elements. A251201

a(n) = floor(Fibonacci(n)/4). A4697

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} whose 2nd cycle has k entries; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements (n>=1; 0<=k<=n-1). For example, 1432=(1)(24)(3) has 2 entries in the 2nd cycle; 3421=(1324) has 0 entries in the 2nd cycle. A138771

a(n) = a(n-1) + a(n-2) + 1 if n is a multiple of 6, otherwise a(n) = a(n-1) + a(n-2). A131132

a(n) = floor(n(n-1)(n-2)(n-3)/20). A11930

Expansion of b(q³) * b(q¹²) / (b(-q) * b(q⁶)) in powers of q where b() is a cubic AGM θ function. A258111

First differences of A275316. A275472

a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/4|. A293553

G.f. A(x) satisfies ∑_n=-oo..+oo (4ⁿ*A(x)ⁿ - 4·A(x))ⁿ⁺¹ = 2·theta₄(x) = 2*∑_n=-oo..+oo (-x)^n². A379764