Properties of the Number 50139

Fifty Thousand One Hundred Thirty-Nine

Basics

Value: 50138 → 50139 → 50140

Parity: odd

Prime: No

Previous Prime: 50131

Next Prime: 50147

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 619

Divisors: 1, 3, 9, 27, 81, 619, 1857, 5571, 16713, 50139

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001111011011

Octal: 141733

Duodecimal: 25023

Hexadecimal: c3db

Square: 2513919321

Square Root: 223.91739548324512

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 nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically. A207419

Numbers k such that the k-th triangular number contains each of the 10 decimal digits exactly once. A115939

Number of nX5 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically. A207416

Number of nX6 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically. A207417

a(n) is the number of distinct products p of Fibonacci numbers such that Fibonacci(n) < p <= Fibonacci(n + 1). A286948

a(n) = ∑_{k=0..floor(n/4)} binomial(n,4·k)*binomial(5·k,k)/(4·k+1). A227035

a(1)=2; for n > 1, a(n) = floor(a(n-1)/2) if this is not among 0, a(1), ..., a(n-1); otherwise a(n) = 4·n. A50139