Properties of the Number 50839

Fifty Thousand Eight Hundred Thirty-Nine

Basics

Value: 50838 → 50839 → 50840

Parity: odd

Prime: Yes

Previous Prime: 50833

Next Prime: 50849

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 50839

Divisors: 1, 50839

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 1100011010010111

Octal: 143227

Duodecimal: 25507

Hexadecimal: c697

Square: 2584603921

Square Root: 225.47505405254924

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

Primes from merging of 5 successive digits in decimal expansion of sqrt(2). A198165

There appear to be at least n primes in the range (x-2·sqrt(x), x] for all x >= a(n). A189027

Numbers k such that 2^k - F(k) is prime, where F(n) is the n-th Fibonacci number. A74716

Odd numbers not of the form p + 2^m with p prime and m >= 0 for which the smallest k in A067760 such that n + 2^k is prime increases. A276495

a(n) = (1/5ⁿ) * ∑_k=0..n² ( (binomial(n², k) * 4^k) (mod 5ⁿ) ). A376534

a(n) = a(n-2) + a(n-1) if that sum is prime. Otherwise, a(n) = a(n-2) + a(n-1) + prime(m-1) + prime(m-2) + ... + prime(s), where a(-1) = a(0) = prime(0) = 1, m = π(a(n-2)), and s = max(0, 1, 2, ..., m-1) such that the sum is prime. A337347

Numbers n such that 175·2ⁿ-1 is prime. A50839