Properties of the Number -121391

One Hundred Twenty-One Thousand Three Hundred Ninety-One

Basics

Value: -121392 → -121391 → -121390

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 19 × 6389

Divisors: 1, 19, 6389, 121391

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -11101101000101111

Octal: -355057

Duodecimal: -5A2BB

Hexadecimal: -1da2f

Square: 14735774881

Square Root: 348.4121123038061

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

a(n) = Fibonacci(n+3) - 2. A1911

Numbers that have 12 terms in their Zeckendorf representation. A179252

Partial sums of repeated Fibonacci sequence. A94707

Partial sums of L(1) - F(1) + L(2) - F(2) + L(3) - F(3) + ..., where L = A000032 and F = A000045. A355019

a(2)=1. a(n) = the largest integer coprime to a(n-1) and less than the n-th Fibonacci number. A157605

a(2t) = a(2t-1) + 1, a(2t+1) = a(2t) + a(2t-2) for t >= 1, with a(0) = a(1) = 1. A226538

a(n) = Fibonacci(2·n) - 2. A249450

a(n) = abs( f(Fibonacci(n)) - Fibonacci(f(n)) ), where f(n) = n-2 if (n mod 3) = 0, f(n) = n+2 if (n mod 3) = 1, otherwise f(n) = n. A103114

Number of irreducible nonpositively curved triangulations of an n-gon: All internal vertices have at valence at least 6 and no diagonals of the n-gon are allowed. A60050

Interprimes which are of the form s·prime, s=19. A75294