Properties of the Number 49644

Forty-Nine Thousand Six Hundred Forty-Four

Basics

Value: 49643 → 49644 → 49645

Parity: even

Prime: No

Previous Prime: 49639

Next Prime: 49663

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 7 × 197

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100000111101100

Octal: 140754

Duodecimal: 24890

Hexadecimal: c1ec

Square: 2464526736

Square Root: 222.8093355315257

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

Let P be Pascal's triangle A007318 and let N be Narayana's triangle A001263, both regarded as lower triangular matrices. Sequence gives triangle obtained from P·N, read by rows. A126182

Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k UU's (doublerises) (n >= 1; 0 <= k <= n-1). A128718

Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k L-shaped corners (n>=2, k>=0). A273717

E.g.f.: x²/(x+3-2·exp(x)). A292934

Integers k for which 1 + A094125(k) = 1 + 3·2^k + 2·3^k is prime. A95378

Triangle read by rows: labeled trees counted by improper edges. A217922

Number of (n+2) X (3+2) 0..1 arrays with every 2 X 2 and 3 X 3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically. A253505

Expansion of e.g.f. -log(1 - 3·x)/(3 * (1 - x)). A384200

6-almost primes with semiprime digits (digits 4, 6, 9 only). A111730

A triangle of infinite sum coefficients with: Limit[Log[1-x],x->0]=-x: p(x,y)=1+n!*x^{n - 1}*Sum[x^k/(k·Binomial[n + k, k]), {k, 1, Infinity}]; such that Log[1-x]->-x. A157047