Properties of the Number -3628

Six Hundred Twenty-Eight

Basics

Value: -3629 → -3628 → -3627

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 907

Divisors: 1, 2, 4, 907, 1814, 3628

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111000101100

Octal: -7054

Duodecimal: -2124

Hexadecimal: -e2c

Square: 13162384

Square Root: 60.23288138550239

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

Number of partitions of n with nonnegative rank. A64174

Numbers k such that k⁶⁴ + 1 is prime. A6316

Number of strict integer partitions of n containing some three possibly equal parts (a,b,c) such that a + b = c. A variation of sum-full strict partitions. A363226

Number of ways to place 3 nonattacking queens on an n X n board. A47659

Number of benzenoids with 23 hexagons, C_2v symmetry and containing n carbon atoms. A123142

Coefficients of the '3rd-order' mock θ function ω(q). A53253

a(n) = (n³ - 7·n + 12)/6. A105163

Number T(n,k) of permutations p of [n] with no fixed points where the maximal displacement of an element equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A259784

Number T(n,k) of ways to place k nonattacking queens on an n X n board; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A348129

A B₂ sequence: a(n) = least value such that the sequence increases and pairwise sums of distinct terms are all distinct. A10672