Properties of the Number -3692

Six Hundred Ninety-Two

Basics

Value: -3693 → -3692 → -3691

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 13 × 71

Divisors: 1, 2, 4, 13, 26, 52, 71, 142, 284, 923

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111001101100

Octal: -7154

Duodecimal: -2178

Hexadecimal: -e6c

Square: 13630864

Square Root: 60.76183012385325

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

Expansion of 1/(1 + x + x/(1 + x² + x²/(1 + x³ + x³/(1 + x⁴ + x⁴/(1 + ...))))), a continued fraction. A292854

Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected and a path of 1's from top row to bottom row. A359574

Number of partitions of n into at most 6 parts. A1402

Number of partitions of n in which the greatest part is 6. A26812

Number of integer partitions of n whose mean is a mode but not the only mode. A363731

Number of partitions of n into parts not greater than sqrt(n). A97356

a(n) = 2*(n² + 2·n - 2). A152811

Least k for the Theodorus spiral to complete n revolutions. A72895

T(n,k)=Number of length n+k 0..3 arrays with at most two downsteps in every k consecutive neighbor pairs. A255660

Number of n X 3 binary arrays with all 1's connected and a path of 1's from top row to bottom row. A163029