Properties of the Number 3285

Three Thousand Two Hundred Eighty-Five

Basics

Value: 3284 → 3285 → 3286

Parity: odd

Prime: No

Previous Prime: 3271

Next Prime: 3299

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 73

Divisors: 1, 3, 5, 9, 15, 45, 73, 219, 365, 657

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110011010101

Octal: 6325

Duodecimal: 1A99

Hexadecimal: cd5

Square: 10791225

Square Root: 57.3149195236284

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(n) = (n⁴ + n)/2 (Row sums of an n X n X n magic cube, when it exists). A27441

Expansion of Jacobi θ constant theta₂⁶ /(64q^3/2). A8440

a(n) = n*(3·n + 11)/2. A59845

Triangle of generalized Stirling numbers S_3,3(n,k) read by rows (n>=1, 3<=k<=3n). A78741

Number of semi-sums of strict integer partitions of n. A366741

Numbers k for which nontrivial positive magic squares of exactly 7 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005. A125014

Triangle T(n,k), n>=0, 0<=k<=n, read by rows: row n is the inverse binomial transform of the n-th row of array A255961, which has the Euler transform of (j->j·k) in column k. A257673

Number of precomplete Post functions. A2824

a(n) = a(n-1) + a(m) for n >= 4, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = a(3) = 1. A50025

T(n,k)=Number of zero-sum -k..k arrays of n elements with first through third differences also in -k..k. A202511