ℕ atory
Play Now

Properties of the Number 50150

Fifty Thousand One Hundred Fifty

Basics

Value: 50149 → 50150 → 50151

Parity: even

Prime: No

Previous Prime: 50147

Next Prime: 50153

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 2 × 17 × 59

Divisors: 1, 2, 5, 10, 17, 25, 34, 50, 59, 85

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1100001111100110

Octal: 141746

Duodecimal: 25032

Hexadecimal: c3e6

Square: 2515022500

Square Root: 223.94195676558692

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

Numbers n such that 7n - 8 is prime. A217131
Number T(n,k) of colored compositions of n using all colors of a k-set such that all parts have different color patterns and the patterns for parts i have i distinct colors in increasing order; triangle T(n,k), n>=0, min(j:A001787(j)>=n)<=k<=n, read by rows. A327583
Nonnegative integers k such that the Chebyshev distance between the vector of proportions of the digits 0-9 in 2k and the uniform distribution (1/10, ..., 1/10) sets a new minimum. A393333
Number of 4-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero. A208598
a(1) = 1; a(2·n) = prime(n)*a(n), a(2·n+1) = prime(n)*a(n) + a(n+1), where prime(n) is the n-th prime. A176716
A triangular sequence of polynomial coefficients: {a,b,c,d}={4, 5, 5, 0}; p(x,n)=(-1)n*(1 - d - c x)n + 1*Sum[(a·k + b)n*(c·x + d)k, {k, 0, Infinity}]. A154630
Odd numbers with prime number of divisors. A50150
Number T(n,k) of colored compositions of n using all colors of a k-set such that all parts have different color patterns and the patterns for parts i have i distinct colors in increasing order; triangle T(n,k), k>=0, k<=n<=k·2k-1, read by columns. A327584