Properties of the Number 12974

Twelve Thousand Nine Hundred Seventy-Four

Basics

Value: 12973 → 12974 → 12975

Parity: even

Prime: No

Previous Prime: 12973

Next Prime: 12979

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 13 × 499

Divisors: 1, 2, 13, 26, 499, 998, 6487, 12974

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11001010101110

Octal: 31256

Duodecimal: 7612

Hexadecimal: 32ae

Square: 168324676

Square Root: 113.9034679015525

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

Sum of the second largest parts of the partitions of n into 10 squarefree parts. A326636

Number of surviving even nodes at generation n in the binary tree of persistently squarefree numbers (see A293230). A293518

Expansion of ∏_k=1..9 (1+x^2·k-1)/(1-x^2·k). A316721

Numbers k for which A354102(k) = A354102(σ(k)). A354106

G.f. A(x) satisfies A(x) = 1 + x / ((1+x)^5/2*A(x)^3/2). A366498

T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..2 nXk array. A220810

T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..3 nXk array. A221024

a(1)=1. For m >= 0 and 1 <= k <= 2^m, a(2^m +k) = a(k) + ∑_j=1..2^m a(j). A139485

Equals one maps: number of n X 2 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..2 n X 2 array. A220806

Number of set partitions of [n] into exactly five parts such that no part contains two elements with a circular distance less than three. A261481