Properties of the Number 68251

Sixty-Eight Thousand Two Hundred Fifty-One

Basics

Value: 68250 → 68251 → 68252

Parity: odd

Prime: No

Previous Prime: 68239

Next Prime: 68261

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 131 × 521

Divisors: 1, 131, 521, 68251

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000101010011011

Octal: 205233

Duodecimal: 335B7

Hexadecimal: 10a9b

Square: 4658199001

Square Root: 261.2489234427579

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

Odd composites m that divide Fibonacci(m)-1. A94394

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

Number of integer partitions of prime(n) into a prime number of prime parts. A316154

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

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

Semiprimes k that divide Fibonacci(k-1). A177086