Properties of the Number 3561

Three Thousand Five Hundred Sixty-One

Basics

Value: 3560 → 3561 → 3562

Parity: odd

Prime: No

Previous Prime: 3559

Next Prime: 3571

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 1187

Divisors: 1, 3, 1187, 3561

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110111101001

Octal: 6751

Duodecimal: 2089

Hexadecimal: de9

Square: 12680721

Square Root: 59.67411499134277

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 inseparable partitions of n; see Comments. A325535

a(n) = ∑_m=1..n ∑_k=1..m prime(k). A14148

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change -1,1 -1,2 1,0 or 0,-1. A264550

Number of hexagons that can be formed with perimeter n. In other words, partitions of n into six parts such that the sum of any 5 is more than the sixth. A69907

Total number of ON cells at stage 2n of two-dimensional 5-neighbor outer totalistic cellular automaton defined by "Rule 453". A246325

Number of strict integer partitions of n into parts > 1 whose product is a multiple of n. A379735

Numbers n such that n!9-1 is prime. A204659

a(n) = ∑_d∣n binomial(n+d-2, n-1). A332508

Number of integer partitions of n having at most one permutation with all equal run-lengths. A383092

Indices of the primes in A095673: A095673(n) = prime(a(n)). A95650