Properties of the Number -67861

Sixty-Seven Thousand Eight Hundred Sixty-One

Basics

Value: -67862 → -67861 → -67860

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 79 × 859

Divisors: 1, 79, 859, 67861

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10000100100010101

Octal: -204425

Duodecimal: -33331

Hexadecimal: -10915

Square: 4605115321

Square Root: 260.5014395353699

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

Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032. A5845

Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers. A69106

Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n). A49062

Primitive part of Lucas(n). A61447

Odd composites m that divide Fibonacci(m)-1. A94394

Frobenius pseudoprimes with respect to Fibonacci polynomial x² - x - 1. A212424

Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1. A94401

Sequence arising from factorization of the Fibonacci numbers. A72183

Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k). A93372

Odd composite integers m such that F(m)² == 1 (mod m) and L(m) == 1 (mod m), where F(m) and L(m) are the m-th Fibonacci and Lucas numbers, respectively. A337625