Properties of the Number -268801

Two Hundred Sixty-Eight Thousand Eight Hundred One

Basics

Value: -268802 → -268801 → -268800

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 13 × 23 × 29 × 31

Divisors: 1, 13, 23, 29, 31, 299, 377, 403, 667, 713

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000001101000000001

Octal: -1015001

Duodecimal: -10B681

Hexadecimal: -41a01

Square: 72253977601

Square Root: 518.4602202676691

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

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

Composite squarefree numbers k such that p+1 divides k-1 for any prime p dividing k. A225711

Numbers k such that ω(k) = 4 and p^ω(k) < k^1/4 < lpf(k)^ω(k+1) for all primes p | k such that p > lpf(k), where lpf = A020639(k). A383178

Nonprimes n such that Mod(n,4) == 1 and denominator(Fibonacci((n-1)/4)/n) = 1. A91982

Smallest number k with n distinct prime factors such that A010846(k) = A024718(n) (a tight lower bound), or -1 if such k does not exist. A384000

Frobenius pseudoprimes == 1,4 (mod 5) with respect to Fibonacci polynomial x² - x - 1. A319168