Properties of the Number -83665

Eighty-Three Thousand Six Hundred Sixty-Five

Basics

Value: -83666 → -83665 → -83664

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 29 × 577

Divisors: 1, 5, 29, 145, 577, 2885, 16733, 83665

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10100011011010001

Octal: -243321

Duodecimal: -40501

Hexadecimal: -146d1

Square: 6999832225

Square Root: 289.2490276561012

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

Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935. A52155

Composite numbers k of the form 4u+1 for which the odd part of φ(k) divides k-1. A339870

Composite numbers k such that 2^k-2 and 3^k-3 are both divisible by k and k is not a Carmichael number (A002997). A153513

Hilltop maps: number of n X 1 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..2 n X 1 array. A218199

Fermat pseudoprimes to base 2 with three prime factors. A215672

Fermat pseudoprimes to base 2 that are decagonal. A321870

Poulet numbers of the form (6k+1)*(24k+1). A182123

Fermat pseudoprimes to base 2 divisible by 5. A216023

Sarrus numbers n (A001567) which satisfy μ(n) = -1 and which are not Super-Poulet numbers (A050217). A74380

Pseudotwinprimes p+2 for primes p such that p+2 divides p^p+2+2 and p+2 is composite. A100873