Properties of the Number -3662

Six Hundred Sixty-Two

Basics

Value: -3663 → -3662 → -3661

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 1831

Divisors: 1, 2, 1831, 3662

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111001001110

Octal: -7116

Duodecimal: -2152

Hexadecimal: -e4e

Square: 13410244

Square Root: 60.51446108162907

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 / ∑_k>=0 x^{k*(2·k - 1}). A361979

Number of reduced words of length n in the Weyl group E₆ on 6 generators and order 51840. A161409

a(n) = ∑_k=1..n floor(n/k)². A222548

Number of integer partitions of n where the parts do not have the same median as the distinct parts. A360244

Number of ways of arranging the numbers 1..n in a circle so that there is no consecutive triple i, i+1, i+2 or i, i-1, i-2 (mod n). A78628

Positions of occurrences of the natural numbers as fourth subsequence in A100035. A100039

a(n) = a(n-1) + a(n-9) for n >= 9; a(n) = 1 for n=0..7; a(8) = 2. A5711

a(n) = a(n-1) + a(m) for n >= 4, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 1. A50041

a(n) is the sum of all pairwise Manhattan distances for optimal towns with n buildings. A193452

T(n,k)=Number of length n arrays of permutations of 0..n-1 with each element moved by -k to k places and exactly one more element moved upwards than downwards. A263764