Properties of the Number 12971

Twelve Thousand Nine Hundred Seventy-One

Basics

Value: 12970 → 12971 → 12972

Parity: odd

Prime: No

Previous Prime: 12967

Next Prime: 12973

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 17 × 109

Divisors: 1, 7, 17, 109, 119, 763, 1853, 12971

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001010101011

Octal: 31253

Duodecimal: 760B

Hexadecimal: 32ab

Square: 168246841

Square Root: 113.89029809426262

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

Numbers n such that φ(n)=2*φ(n-1). A171271

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k cycles that are either nonincreasing or of length 1 (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... . A186759

Number of partitions p of n including ceiling(mean(p)) as a part. A241336

Sums of seven consecutive squares: a(n) = n² + (n+1)² + (n+2)² + (n+3)² + (n+4)² + (n+5)² + (n+6)². A260637

The number of biconnected squaregraphs with n vertices. A194092

a(n) = (12·n+1)*(12·n+11). A1538

Total number of largest parts in all partitions of n that contain at least two distinct parts. A182629

Number of partitions of n that contain at least one odd prime as a part. A355193

Iteration of Abelian sandpile model where the n-th matrix expansions occurs. Begins with infinite sand in 1 X 1 matrix. A328506

Triangle of Eulerian numbers T(n,k) (n >= 1, 1 <= k <= n) read by rows. A8292