Properties of the Number 50299

Fifty Thousand Two Hundred Ninety-Nine

Basics

Value: 50298 → 50299 → 50300

Parity: odd

Prime: No

Previous Prime: 50291

Next Prime: 50311

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 179 × 281

Divisors: 1, 179, 281, 50299

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1100010001111011

Octal: 142173

Duodecimal: 25137

Hexadecimal: c47b

Square: 2529989401

Square Root: 224.2743855191671

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(j) = maximum value of n for each distinct increasing value of (Sum of the quadratic non-residues of prime(n) - Sum of the quadratic residues of prime(n)) / prime(n) for each j. A166263

k such that 0 = ∑_j=1..k A373223(k, j). The indices of the rows in Gauss's triangle with vanishing row sums. A373181

Numerators of Bernoulli(x)^x. A199749

T(n,k)=Number of -k..k arrays x(0..n+2) of n+3 elements with zero sum and no two or three adjacent elements summing to zero. A200430

Numbers k such that ((k-1)! + 1)/k is prime. A50299

Numbers n = concat(x,y) such that (x - φ(x)) * (y - φ(y)) = n - φ(n), where n - φ(n) is the Euler cototient function of n. A272157

Number of -n..n arrays x(0..9) of 10 elements with zero sum and no two or three adjacent elements summing to zero. A200437