Properties of the Number 3247

Three Thousand Two Hundred Forty-Seven

Basics

Value: 3246 → 3247 → 3248

Parity: odd

Prime: No

Previous Prime: 3229

Next Prime: 3251

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 17 × 191

Divisors: 1, 17, 191, 3247

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010101111

Octal: 6257

Duodecimal: 1A67

Hexadecimal: caf

Square: 10543009

Square Root: 56.9824534396335

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

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3⁴.6 2D tiling (cf. A250120). A299254

Number of integer partitions of n such that every set of distinct parts has a different sum. A325862

Triangle read by rows: row n is the first row of the matrix M[n]^n-1, where M[n] is the n X n tridiagonal matrix with main diagonal (1,4,4,...) and super- and subdiagonals (1,1,1,...). A124576

Number of partitions of n such that every part divides the largest part; a(0) = 1. A130689

L-toothpick sequence (see Comment lines for definition). A172310

T(n,k)=1/4 the number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of sign(x(i))*(|x(i)| mod x(i+1)) equal to zero. A189951

a(n) = 4·n² + 4·n - 1. A73577

Number of Motzkin paths of length n with no level steps at even level. A90345

Number of different, not necessarily connected, unlabeled trivalent diagrams of size n. A121352

T(n,k)=Number of nXk 0..5 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other. A200902