Properties of the Number -42719

Forty-Two Thousand Seven Hundred Nineteen

Basics

Value: -42720 → -42719 → -42718

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 42719

Divisors: 1, 42719

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1010011011011111

Octal: -123337

Duodecimal: -2087B

Hexadecimal: -a6df

Square: 1824912961

Square Root: 206.68575180694

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 whose least quadratic nonresidue (A020649) is 19. A25027

a(n) = (4·n³-3·n²+5·n-3)/3. A177342

Least prime p such that more than half of all integers are divisible by n distinct primes not greater than p. A284411

Odd numbers n for which 19 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1. A112078

Primes p such that A008472(p-1) = A008472(p+1), where A008472 = sum of distinct primes dividing n. A203182

Number of ways to represent n using the binary operator a·b = 2^a + b. A630

Primes with 19 as smallest positive primitive root. A61331

Primes p such that 2·p⁴+-9 are also prime. A174365

a(n) is a prime number that cannot be the center term of a length 3 arithmetic progression prime group with a common difference whose number of runs in binary expansion is 2. A231387

a(0) = a(1) = 1, a(n) is the smallest positive integer m >= a(n-1) + a(n-2) such that gcd(a(k),m) = 1 for all 1 < k <= n - 1. A345471