Properties of the Number -27323

Twenty-Seven Thousand Three Hundred Twenty-Three

Basics

Value: -27324 → -27323 → -27322

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 89 × 307

Divisors: 1, 89, 307, 27323

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110101010111011

Octal: -65273

Duodecimal: -1398B

Hexadecimal: -6abb

Square: 746546329

Square Root: 165.2967029314257

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

Composite numbers k that divide Fibonacci(k+1). A69107

Odd composite integers m such that F(m)² == 1 (mod m), where F(m) is the m-th Fibonacci number. A337231

G.f.: 1/(1 - x/(1 - x⁴/(1 - x⁹/(1 - x¹⁶/(1 - x²⁵/(1 - x³⁶/(1 -...- x^n²/(1 -...))))))), a continued fraction. A206739

Lucas pseudoprimes. A217120

Odd composite integers m such that A001906(m-J(m,5)) == 0 (mod m) and gcd(m,5)=1, where J(m,5) is the Jacobi symbol. A340097

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

Numbers k that divide Fibonacci(k+1) but do not divide Fibonacci(k) + 1. A94412