Properties of the Number 3647

Three Thousand Six Hundred Forty-Seven

Basics

Value: 3646 → 3647 → 3648

Parity: odd

Prime: No

Previous Prime: 3643

Next Prime: 3659

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 521

Divisors: 1, 7, 521, 3647

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111000111111

Octal: 7077

Duodecimal: 213B

Hexadecimal: e3f

Square: 13300609

Square Root: 60.390396587537

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(0) = 1, a(n) = 5·n² + 2 for n>0. A10001

Number of integer partitions of n without any three parts (a,b,c) (repeats allowed) satisfying a + b = c. A variation of sum-free partitions. A364345

Numbers that are the sum of 7 positive 6th powers. A3363

a(n) = floor(n*φ¹³), where φ is the golden ratio, A001622. A4928

a(1) = 7; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A74343

Numbers n such that n, n+2, n+4, n+6 are semiprimes. A92126

A sequence of asymptotic density ζ(7) - 1, where ζ is the Riemann ζ function. A143033

a(n) = n*(n-th prime) + (n+1)*((n+1)-th prime). A152117

T(n,k)=Number of -k..k arrays of length n with the sum ahead of each element differing from the sum following that element by k or less. A221967

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