Properties of the Number -113201

One Hundred Thirteen Thousand Two Hundred One

Basics

Value: -113202 → -113201 → -113200

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 11 × 41 × 251

Divisors: 1, 11, 41, 251, 451, 2761, 10291, 113201

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11011101000110001

Octal: -335061

Duodecimal: -55615

Hexadecimal: -1ba31

Square: 12814466401

Square Root: 336.45356291767814

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

Composite numbers k such that k == +-1 (mod 8) and 2^(k-1/2) == 1 (mod k). A6971

Base-5 Euler-Jacobi pseudoprimes: odd composite k coprime to 5 such that 5^(k-1/2) == (5/k) (mod n), where (5/k) is the Jacobi symbol (or Kronecker symbol). A375914

Composite numbers k == 1, 9 (mod 10) such that 5^(k-1/2) == 1 (mod k). A375915

Cupolar numbers: a(n) = (n+1)*(5·n² + 7·n + 3)/3. A96000

Composite numbers k == 1 (mod 4) such that (1 + i)^k == 1 + i (mod k), where i = sqrt(-1). A270698

Fermat pseudoprimes to base 2 with three prime factors. A215672

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

Pseudoprimes to bases 2 and 5. A83732

Strong pseudoprimes to base 40. A20266

a(n) = Fibonacci(n) - 2^floor(n/2). A28892