Properties of the Number 50193

Fifty Thousand One Hundred Ninety-Three

Basics

Value: 50192 → 50193 → 50194

Parity: odd

Prime: No

Previous Prime: 50177

Next Prime: 50207

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 11 × 13 ²

Divisors: 1, 3, 9, 11, 13, 27, 33, 39, 99, 117

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100010000010001

Octal: 142021

Duodecimal: 25069

Hexadecimal: c411

Square: 2519337249

Square Root: 224.03794321498313

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 with every element unequal to 0, 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero. A316209

Numbers k such that between k and the next prime there are gpf(k) numbers, where gpf(k) denotes the largest prime factor of k. A235425

Number of tilings of an n X 1 rectangle (using tiles of dimension 1 X 1 and 2 X 1) that are not the concatenation of smaller equally-sized tilings. A224918

Number of sawtooth patterns of length 1 in all Dyck paths of semilength n. A225015

a(0) = a(1) = 1, and a(n) = a(n-1) + a( (a(n-1)-1) mod n ) for n>=2. A268176

Indices of primes in the sequence defined by A(0) = 23, A(n) = 10·A(n-1) + 63 for n > 0. A101973

Number of nX5 0..1 arrays with every element unequal to 0, 1, 2 or 3 king-move adjacent elements, with upper left element zero. A303724

Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero. A316204

a(n)=a(n-1)+a(n-2)-d, where d=a(n/3) if 3 divides n, else d=0; 2 initial terms. A50193

Denominator coefficients of infinite over the Fibonacci sequence: p(x,n)=(1 - x)*Sum[Fibonacci[k]ⁿ*x^k, {k, 0, Infinity}]; t(n,m)=Coefficients(Numerator(p(x,n)). A156135