Properties of the Number 3696

Three Thousand Six Hundred Ninety-Six

Basics

Value: 3695 → 3696 → 3697

Parity: even

Prime: No

Previous Prime: 3691

Next Prime: 3697

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 7 × 11

Divisors: 1, 2, 3, 4, 6, 7, 8, 11, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111001110000

Octal: 7160

Duodecimal: 2180

Hexadecimal: e70

Square: 13660416

Square Root: 60.794736614282655

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

Sum of all parts of all partitions of n. A66186

a(n) = n*σ(n). A64987

a(n) = 2·n² - 2. A54000

Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere. A35008

Triangular array read by rows: T(n,k) = Fibonacci(n+1-k)*C(n,k-1), k = 1..n; n >= 1. A94440

a(n) = σ(n) * A003961(n), where A003961 shifts the prime factorization of n one step towards larger primes, and σ is the sum of the divisors of n. A341529

Number of integer partitions of n having a part that can be written as a nonnegative linear combination of the other (possibly equal) parts. A364913

7 times triangular numbers: 7·n*(n+1)/2. A24966

Smallest k such that φ(x) = k has exactly n solutions, n>=2. A7374

Number of regions in regular n-gon which are quadrilaterals (4-gons) when all its diagonals are drawn. A67151