Properties of the Number 50789

Fifty Thousand Seven Hundred Eighty-Nine

Basics

Value: 50788 → 50789 → 50790

Parity: odd

Prime: Yes

Previous Prime: 50777

Next Prime: 50821

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 50789

Divisors: 1, 50789

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011001100101

Octal: 143145

Duodecimal: 25485

Hexadecimal: c665

Square: 2579522521

Square Root: 225.36414976655004

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 no 1 equal to more than three of its horizontal, diagonal and antidiagonal neighbors. A283857

Primes p such that q-p = 32, where q is the next prime after p. A126784

Primes 10k + 9 at the end of the maximal gaps in A269261. A269263

Primes of the form 6n² + 5. A201600

Primes that indicate that the total frequency of every decimal digit in the set of all primes up to and including that prime is odd. A192448

Number of 2 X n 0..1 arrays with no 1 equal to more than three of its horizontal, diagonal and antidiagonal neighbors. A283858

Numbers k such that 7·10^k - 47 is prime. A282457

Consider the Diophantine equation x³ + y³ = z³ - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y. A50789

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