Properties of the Number -3604

Six Hundred Four

Basics

Value: -3605 → -3604 → -3603

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 17 × 53

Divisors: 1, 2, 4, 17, 34, 53, 68, 106, 212, 901

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -111000010100

Octal: -7024

Duodecimal: -2104

Hexadecimal: -e14

Square: 12988816

Square Root: 60.03332407921454

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) = 2n(19-n). A182428

Q-toothpick sequence (see Comments for precise definition). A187210

Self-convolution of 1 2 3 5 7 11 15 22 30 42 56 77 ... (A000041). A48574

Number of ordered trees with n edges and no unary or binary nodes. A114997

Starts of runs of 3 consecutive positive negabinary-Niven numbers (A331728). A331822

T(n,k)=Number of nXk 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281205

a(n) = n*(3·n + 4). A140676

Array read by antidiagonals: T(n,k) = number of rooted n-dimensional polycubes with k cells, with no symmetries removed (n >= 1, k >= 1). A48790

a(n) is the smallest positive integer s that can be partitioned into n positive integers whose product is s·100^n-1. A380887

Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 7 sites wide. A58366