Properties of the Number 12593

Twelve Thousand Five Hundred Ninety-Three

Basics

Value: 12592 → 12593 → 12594

Parity: odd

Prime: No

Previous Prime: 12589

Next Prime: 12601

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 ² × 257

Divisors: 1, 7, 49, 257, 1799, 12593

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000100110001

Octal: 30461

Duodecimal: 7355

Hexadecimal: 3131

Square: 158583649

Square Root: 112.21853679316978

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

Start with 61; to get the next term, divide by the smallest prime factor < 17 if it exists, else multiply by 17 and add 1. A57534

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing odd cycles (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)<... . A cycle is said to be odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 3 increasing odd cycles. A186761

Positive numbers of the form x⁴ - 6·x² * y² + y⁴ (where x,y are integers). A135789

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1. A234122

Number of permutations of {1,2,...,n} having no increasing odd cycles. 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)<... . A cycle is said to be odd if it has an odd number of entries. A186762

Number of partitions of n with exactly four part sizes. A365630

Number of partitions p of n such that median(p) = multiplicity(min(p)). A240214

Number of integer partitions of n whose semi-sums cover an interval of positive integers. A367402

a(n) = 2ⁿ-n⁴. A24014

G.f. satisfies: A(x) = 1/(1 + x·A(x⁵)) and also the continued fraction: 1+x·A(x⁶) = [1;1/x,1/x⁵,1/x²⁵,1/x¹²⁵,...,1/x^{5^(n-1}),...]. A101915