Properties of the Number -100127

One Hundred Thousand One Hundred Twenty-Seven

Basics

Value: -100128 → -100127 → -100126

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 223 × 449

Divisors: 1, 223, 449, 100127

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11000011100011111

Octal: -303437

Duodecimal: -49B3B

Hexadecimal: -1871f

Square: 10025416129

Square Root: 316.4285069332408

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

Odd composite n such that n divides Fibonacci(n) + 1. A94395

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

Smallest k such that n times concatenation of k with itself followed by a 7 is a prime, or 0 if no such number exists. A87605

Numbers k such that σ(k+1) = 3 * σ(k). A77087

Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n). A94063

Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(k) + 1. A94411

Strong Lucas pseudoprimes. A217255

Extra strong Lucas pseudoprimes. A217719

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