Properties of the Number -256999

Two Hundred Fifty-Six Thousand Nine Hundred Ninety-Nine

Basics

Value: -257000 → -256999 → -256998

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 40

Digital Root: 4

Palindrome: No

Factorization: 233 × 1103

Divisors: 1, 233, 1103, 256999

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -111110101111100111

Octal: -765747

Duodecimal: -104887

Hexadecimal: -3ebe7

Square: 66048486001

Square Root: 506.9506879371997

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

Strong pseudoprimes to base 2. A1262

Overpseudoprimes to base 2: composite k such that k = A137576((k-1)/2). A141232

Composite numbers k == 3 (mod 4) such that (1 + i)^k == 1 - i (mod k), where i = sqrt(-1). A270697

Numbers k such that 2^k-1 == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k. A316907

Numbers n such that game of n X n Button Madness need have no solution; this lists only the primitive elements of the set. A7802

Pseudoprimes to base 2 of the form 4k+3. A177884

Base-2 Fermat pseudoprimes k such that the multiplicative order of 2 modulo k is odd. A367230

Smallest base-2 Fermat pseudoprime·that has ord(2,x) = n, or 0 if one does not exist. A86250

Numbers k > 1 such that 2^k == 2 (mod k) and gcd(k, 3^k - 3) = 1. A300762

Numbers k such that 2^k-1 == 1 (mod k) and lpf(k)-1 does not divide k-1. A316906