Properties of the Number -6601

Six Hundred One

Basics

Value: -6602 → -6601 → -6600

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 7 × 23 × 41

Divisors: 1, 7, 23, 41, 161, 287, 943, 6601

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1100111001001

Octal: -14711

Duodecimal: -39A1

Hexadecimal: -19c9

Square: 43573201

Square Root: 81.24653838779841

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

Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers. A1567

Carmichael numbers: composite numbers k such that a^k-1 == 1 (mod k) for every a coprime to k. A2997

10-gonal (or decagonal) numbers: a(n) = n*(4·n-3). A1107

3-Carmichael numbers: Carmichael numbers equal to the product of 3 primes: k = p·q*r, where p < q < r are primes such that a^k-1 == 1 (mod k) if a is prime to k. A87788

Pseudoprimes to base 3. A5935

Euler pseudoprimes: composite numbers n such that 2^(n-1/2) == +-1 (mod n). A6970

Generalized 28-gonal (or icosioctagonal) numbers: m*(13·m - 12) with m = 0, +1, -1, +2, -2, +3, -3, ... A303812

Generalized 26-gonal (or icosihexagonal) numbers: m*(12·m - 11) with m = 0, +1, -1, +2, -2, +3, -3, ... A316724

Number of partitions of n which represent first player winning Chomp positions. A112471

Generalized Fibonacci numbers: a(n) = a(n-1) + 11·a(n-2). A15447