Properties of the Number 50163

Fifty Thousand One Hundred Sixty-Three

Basics

Value: 50162 → 50163 → 50164

Parity: odd

Prime: No

Previous Prime: 50159

Next Prime: 50177

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 23 × 727

Divisors: 1, 3, 23, 69, 727, 2181, 16721, 50163

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1100001111110011

Octal: 141763

Duodecimal: 25043

Hexadecimal: c3f3

Square: 2516326569

Square Root: 223.9709802630689

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

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 2-cell columns (n>=1; 0<=k<=n-1). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121637

a(n) is the smallest number that belongs simultaneously to the two arithmetic progressions prime(n) + m·prime(n+1) and prime(n+1) + m·prime(n+2), m >= 1, n >= 1. A319524

Number of deco polyominoes of height n, having no 2-cell columns. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A121638

a(n) = ∑_k=1..n k^k * binomial(floor(n/k)+1,2). A356127

T(n, k) = S(2n+2, n+2, k+2) for 0<=k<=n and n >= 0, array S as in A050157. A50163