Properties of the Number 50220

Fifty Thousand Two Hundred Twenty

Basics

Value: 50219 → 50220 → 50221

Parity: even

Prime: No

Previous Prime: 50207

Next Prime: 50221

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ⁴ × 5 × 31

Divisors: 1, 2, 3, 4, 5, 6, 9, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100010000101100

Octal: 142054

Duodecimal: 25090

Hexadecimal: c42c

Square: 2522048400

Square Root: 224.0981927637972

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

a(n) = σ(n) * A003961(n), where A003961 shifts the prime factorization of n one step towards larger primes, and σ is the sum of the divisors of n. A341529

Numbers i such that Fibonacci(i) is divisible by i, i+1, i+2, and i+3. A298685

a(n) = σ(n) * A332818(n). A389082

a(n) = lcm(σ(n), A003961(n)), where A003961 is fully multiplicative with a(prime(k)) = prime(k+1), and σ is the sum of divisors of n. A342672

Larger of Smith brothers. A50220

Triangle read by rows, T(n,k) = [x^k] ∑_k=0..n p_n,k(x) where p_n,k(x) = x^n-k*binomial(n,k)*hypergeom([-k, k-n, k-n], [1, -n], 1/x), for 0 <= k <= n. A299500