Properties of the Number -15841

Fifteen Thousand Eight Hundred Forty-One

Basics

Value: -15842 → -15841 → -15840

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 7 × 31 × 73

Divisors: 1, 7, 31, 73, 217, 511, 2263, 15841

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11110111100001

Octal: -36741

Duodecimal: -9201

Hexadecimal: -3de1

Square: 250937281

Square Root: 125.86103447850729

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

Strong pseudoprimes to base 2. A1262

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

The non-repetitive Kaprekar binary numbers in decimal. A163205

Centered 16-gonal numbers. A69129

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

Euler-Jacobi pseudoprimes: 2^(n-1/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol. A47713

a(n) = 2·a(n-1) + 2·a(n-2) - a(n-3) with a(-1) = 1, a(0) = 1, a(1) = 1. A61646