Properties of the Number -65077

Sixty-Five Thousand Seventy-Seven

Basics

Value: -65078 → -65077 → -65076

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 59 × 1103

Divisors: 1, 59, 1103, 65077

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1111111000110101

Octal: -177065

Duodecimal: -317B1

Hexadecimal: -fe35

Square: 4235015929

Square Root: 255.1019404081435

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

Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d∣2^d-2. A50217

Fermat pseudoprimes to base 2 with two prime factors. A214305

Strong pseudoprimes to base 4. A20230

Odd numbers k > 1 such that 2^(k-1/2) == -(2/k) = -A091337(k) (mod k), where (2/k) is the Jacobi (or Kronecker) symbol. A306310

Composite integers k such that 2^d == 2^k/d (mod k) for all d∣k. A291601

Consecutive internal states of the linear congruential pseudo-random number generator (421·s + 54773) mod 259200 when started at 1. A383129

Semiprime 2-pseudoprimes of the form 10k + 7. A216667

The "residue" pseudoprimes: odd composite numbers n such that q(n)^(n-1/2) == 1 (mod n), where base q(n) is the smallest prime quadratic residue modulo n. A307798

a(n) = 1 + 4·n*(1 + 2·n²)/3. A171272

Fermat pseudoprimes to base 2 of the form (6·k - 1)*((6·k - 2)*n + 1), where k and n are positive integers. A210993