Properties of the Number -103683

One Hundred Three Thousand Six Hundred Eighty-Three

Basics

Value: -103684 → -103683 → -103682

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 17 × 19 × 107

Divisors: 1, 3, 17, 19, 51, 57, 107, 321, 323, 969

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -11001010100000011

Octal: -312403

Duodecimal: -50003

Hexadecimal: -19503

Square: 10750164489

Square Root: 321.99844720122485

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) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2. A1612

a(n) = 5·F(n)² + 3*(-1)ⁿ where F(n) are the Fibonacci numbers A000045. A47946

a(n) = F(12·n)/(12²) with the Fibonacci numbers F = A000045. A253368

a(n) = Lucas(2·n) + 1. A65034

Numbers having three 1's in their base-φ representation. A104626

Integers that appear as ratios of Fibonacci numbers F(kn)/F(k), but omitting Fibonacci numbers F(n)/F(1) and Lucas numbers F(2n)/F(n). A31122

a(n) = Lucas(n) + (-1)ⁿ. A99925

List of numbers L and L + 1, where L = A000032, the Lucas numbers, sorted into increasing order and duplicates removed. A259626

Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square. A69110

Numbers k such that the two perfect powers immediately adjacent to k² both have exponents greater than 2. A340643