Properties of the Number -253241

Two Hundred Fifty-Three Thousand Two Hundred Forty-One

Basics

Value: -253242 → -253241 → -253240

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 157 × 1613

Divisors: 1, 157, 1613, 253241

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111101110100111001

Octal: -756471

Duodecimal: -102675

Hexadecimal: -3dd39

Square: 64131004081

Square Root: 503.23056345973265

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

Strong pseudoprimes (base 2) that become prime when two is added. A230484

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

Strong pseudoprimes k to base 2 such that either k-2 or k+2 is prime. A230487

Lesser of overpseudo-twin-primes to base 2 defined in Comment. A195468

Pseudoprimes to a twin prime criterion of Aebi and Cairns. A224695

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