Properties of the Number -50207

Fifty Thousand Two Hundred Seven

Basics

Value: -50208 → -50207 → -50206

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 50207

Divisors: 1, 50207

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1100010000011111

Octal: -142037

Duodecimal: -2507B

Hexadecimal: -c41f

Square: 2520742849

Square Root: 224.06918574404648

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

Euclid-Mullin sequence: a(1) = 2, a(n+1) is the largest prime factor of 1 + ∏_k=1..n a(k). A946

Base-6 pandigital primes: primes having at least one of each digit 0,1,2,3,4,5 when written in base 6. A175278

Primes p such that the Fibonacci iterations starting with (1, p) lead to a "nine digits anagram". A34588

Primes p such that if q and r are the next two primes, (p - 1)² + 1, (q - 1)² + 1 and (r - 1)² + 1 are all prime. A376605

Let a(1)=1; for n>1, a(n)=nextprime((3/2)*a(n-1)). A84571

A variant of the Euclid-Mullin sequence A000945: a(1) = 2, a(n+1) is smallest prime factor congruent to 3 (mod 4) of ∏_k=1..n a(k) + 1. A218467

Smallest prime factor of 4·n! - 1. A262375

Smallest prime of the form 4·k + 3 that is a divisor of 4·n! - 1. A333924

Primes having only {0, 2, 5, 7} as digits. A386049

Essentially a duplicate of A000946. A83369