Properties of the Number 3605

Three Thousand Six Hundred Five

Basics

Value: 3604 → 3605 → 3606

Parity: odd

Prime: No

Previous Prime: 3593

Next Prime: 3607

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 7 × 103

Divisors: 1, 5, 7, 35, 103, 515, 721, 3605

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111000010101

Octal: 7025

Duodecimal: 2105

Hexadecimal: e15

Square: 12996025

Square Root: 60.0416522091123

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

Octagonal numbers: n*(3·n-2). Also called star numbers. A567

Centered tetrahedral numbers. A5894

Number of Carmichael numbers (A002997) less than 10ⁿ. A55553

Partial sums of A299277. A299278

Triangle read by rows: T(n,k) = number of lattice paths from (0,0) to (n,k) that do not go below the line y=0 and consist of steps U=(1,1), D=(1,-1) and three types of steps H=(1,0) (left factors of 3-Motzkin steps). A91965

Number of partitions of n with odd minimal and maximal parts. A325338

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250729

Odd octagonal numbers: (2n+1)*(6n+1). A14641

T(n,k)=Number of nXk 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A281469

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302623