Properties of the Number 50144

Fifty Thousand One Hundred Forty-Four

Basics

Value: 50143 → 50144 → 50145

Parity: even

Prime: No

Previous Prime: 50131

Next Prime: 50147

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁵ × 1567

Divisors: 1, 2, 4, 8, 16, 32, 1567, 3134, 6268, 12536

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001111100000

Octal: 141740

Duodecimal: 25028

Hexadecimal: c3e0

Square: 2514420736

Square Root: 223.92856003645448

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

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 5 6 or 8 and every 3X3 column and antidiagonal sum not equal to 0 3 5 6 or 8. A252615

Numerators of continued fraction convergents to sqrt(750). A42444

Triangle read by rows: T(n,k) = number of Schroeder (or royal) n-paths (A006318) containing k returns to the diagonal y=x. (A northeast step lying on y=x contributes a return.) A108891

a(n) = 49·n² - n. A157923

a(n) = 196·n² - 2·n. A158224

a(n) = 1024·n² - 32. A158683

G.f.: ((1-q)²+(1+q)*sqrt(1-6·q+q²))/2. A177010

Numbers up to 10ⁿ with an odd number of prime factors, or negative Liouville function. A212819

T(n,k) is the number of order-decreasing and order-preserving partial transformations (of an n-chain) of waist k (waist(α) = max(Im(α))). A145035

Number of (1+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 8 and every 3X3 column and antidiagonal sum not equal to 0 3 5 6 or 8. A252616