Properties of the Number -3607

Six Hundred Seven

Basics

Value: -3608 → -3607 → -3606

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 3607

Divisors: 1, 3607

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111000010111

Octal: -7027

Duodecimal: -2107

Hexadecimal: -e17

Square: 13010449

Square Root: 60.05830500438719

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

Triangle, read by rows of n² terms, where row n equals the coefficients in the series reversion of the function G(y,n)-1 such that: y = ∑_m>=1 1/G(y,n)^2·n*m * ∏_k=1..m (1 - 1/G(y,n)^2·k-1). A214690

Numerators of an asymptotic expansion for the number of forests on n nodes (A001858). A6572

Triangle T(n, k) = k⁴ - n⁴ + 2·k*n*(1 - k²*n²), read by rows. A123963

Primes of the form 7x²+4xy+52y². A140633

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3.3.4.3.4 2D tiling (cf. A219529). A299255

Primes from merging of 4 successive digits in decimal expansion of π. A104824

a(n) is the solution to the postage stamp problem with 6 denominations and n stamps. A1211

Triangle of Eulerian numbers with rows multiplied by 1 + x. A8518

Number of integer partitions of n with one fewer distinct multiplicities than distinct parts. A325244

Initial term in sequence of four consecutive primes whose consecutive differences have d-pattern = [6, 4, 6]; short d-string notation for pattern = [646]. A78856