Properties of the Number -40501

Forty Thousand Five Hundred One

Basics

Value: -40502 → -40501 → -40500

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 101 × 401

Divisors: 1, 101, 401, 40501

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001111000110101

Octal: -117065

Duodecimal: -1B531

Hexadecimal: -9e35

Square: 1640331001

Square Root: 201.2486024796197

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

Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5). A81264

Strong pseudoprimes to base 5. A20231

Euler pseudoprimes to base 5: composite integers such that abs(5^{(n - 1}/2)) == 1 mod n. A262052

Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers. A69106

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

Number of partitions of n containing m(5) as a part, where m denotes multiplicity. A240490

Composite numbers k that divide Fibonacci(k+1) or Fibonacci(k-1). A182554

Odd composite integers m such that A000032(2·m-J(m,5)) == J(m,5) (mod m), where J(m,5) is the Jacobi symbol. A339517

Odd composite integers m such that A000045(2·m-J(m,5)) == 1 (mod m), where J(m,5) is the Jacobi symbol. A340118