Properties of the Number 13587

Thirteen Thousand Five Hundred Eighty-Seven

Basics

Value: 13586 → 13587 → 13588

Parity: odd

Prime: No

Previous Prime: 13577

Next Prime: 13591

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 647

Divisors: 1, 3, 7, 21, 647, 1941, 4529, 13587

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010100010011

Octal: 32423

Duodecimal: 7A43

Hexadecimal: 3513

Square: 184606569

Square Root: 116.56328753085167

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 whose sum of divisors is a fourth power. A19422

Triangle T(n,k): number of ways of partitioning the n-element multiset {1,1,2,3,...,n-1} into exactly k nonempty parts, n>=1 and 1<=k<=n. A241500

G.f.: A(x) = F(x·G(x)³) where F(x) = G(x/F(x)²) = 1 + x·F(x)² is the g.f. of A000108 (Catalan) and G(x) = F(x·G(x)²) = 1 + x·G(x)⁴ is the g.f. of A002293. A153396

Values of n such that n² + (n-d)² is prime for a record first value of d. A239390

a(n) = floor(n*(n-1)*(n-2)*(n-3)/31). A11941

Smallest composite which when sum of prime factors is repeatedly subtracted reaches a prime after n iterations. A53093

Expansion of ∏_k>0 (1 + ∑_m>0 x^k·m!). A304332

Numbers k such that 249·2^k+1 is prime. A32501

Sort then Add, a(1)=3. A33893

Number of Proth primes < 10ⁿ. A239234