Properties of the Number 97921

Ninety-Seven Thousand Nine Hundred Twenty-One

Basics

Value: 97920 → 97921 → 97922

Parity: odd

Prime: No

Previous Prime: 97919

Next Prime: 97927

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 181 × 541

Divisors: 1, 181, 541, 97921

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10111111010000001

Octal: 277201

Duodecimal: 48801

Hexadecimal: 17e81

Square: 9588522241

Square Root: 312.92331328937445

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

Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032. A5845

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

Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n). A49062

Strong pseudoprimes to base 6. A20232

Frobenius pseudoprimes with respect to Fibonacci polynomial x² - x - 1. A212424

Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1. A94401

Sequence arising from factorization of the Fibonacci numbers. A72183

Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k). A93372

Octagonal numbers (A000567) that are semiprimes (A001358). A259677

Odd composite integers m such that F(m)² == 1 (mod m) and L(m) == 1 (mod m), where F(m) and L(m) are the m-th Fibonacci and Lucas numbers, respectively. A337625