Properties of the Number 3277

Three Thousand Two Hundred Seventy-Seven

Basics

Value: 3276 → 3277 → 3278

Parity: odd

Prime: No

Previous Prime: 3271

Next Prime: 3299

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 29 × 113

Divisors: 1, 29, 113, 3277

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110011001101

Octal: 6315

Duodecimal: 1A91

Hexadecimal: ccd

Square: 10738729

Square Root: 57.245087125446844

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

Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers. A1567

10-gonal (or decagonal) numbers: a(n) = n*(4·n-3). A1107

Strong pseudoprimes to base 2. A1262

a(n) = 3·a(n-1) + 4·a(n-2), a(0) = 0, a(1) = 1. A15521

Cyclotomic polynomials at x=2. A19320

Euler pseudoprimes: composite numbers n such that 2^(n-1/2) == +-1 (mod n). A6970

Overpseudoprimes to base 2: composite k such that k = A137576((k-1)/2). A141232

Zsigmondy numbers for a = 2, b = 1: Zs(n, 2, 1) is the greatest divisor of 2ⁿ - 1 (A000225) that is coprime to 2^m - 1 for all positive integers m < n. A64078

a(n) = n*(n² - 6·n + 11)/6. A50407

Composite numbers k congruent to 5 (mod 8) such that 2^(k-1/2) mod k = k-1. A244626