Properties of the Number 3695

Three Thousand Six Hundred Ninety-Five

Basics

Value: 3694 → 3695 → 3696

Parity: odd

Prime: No

Previous Prime: 3691

Next Prime: 3697

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 739

Divisors: 1, 5, 739, 3695

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111001101111

Octal: 7157

Duodecimal: 217B

Hexadecimal: e6f

Square: 13653025

Square Root: 60.78651166171653

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 integer partitions of n whose median appears more times than any other part, i.e., partitions containing a unique mode equal to the median. A363740

Expansion of ∏_m>=1 ((1+q^2·m-1)/(1+q^2·m))⁷. A29844

Sum of the sizes of the Durfee squares of all no-leg partitions of n (or of all no-arm partitions of n). A268188

The number of n-almost primes less than or equal to 12ⁿ, starting with a(0)=1. A116431

A156348·A000010. A156834

a(n) = 2·n² + 8·n + 5. A268581

Coefficients of a mock θ function. A192433

Expansion of ∏_k=1..7 (1+x^2·k-1)/(1-x^2·k). A316719

Let t_k denote the triangular number k*(k+1)/2. Suppose 0 < x < y < z are integers satisfying t_x + t_y = t_p, t_y + t_z = t_q, t_x + t_z = t_r, for integers p,q,r. Sort the triples [x,y,z] first by x, then by y. Sequence gives the values of r. A332593

Let A(n) = #{(i,j,k): i² + j² + k² <= n}, V(n) = (4/3)*π*n^3/2, P(n) = A(n) - V(n); A000092 gives values of n where |P(n)| sets a new record; sequence gives A(A000092(n)). A413