Properties of the Number 13607

Thirteen Thousand Six Hundred Seven

Basics

Value: 13606 → 13607 → 13608

Parity: odd

Prime: No

Previous Prime: 13597

Next Prime: 13613

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 11 × 1237

Divisors: 1, 11, 1237, 13607

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11010100100111

Octal: 32447

Duodecimal: 7A5B

Hexadecimal: 3527

Square: 185150449

Square Root: 116.64904628842878

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

a(n) is the least k such that the remainder when 8^k is divided by k is n. A119714

T(n,k) = number of n-bead necklaces labeled with numbers -k..k not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2. A209115

Numbers n such that n+2·prime(n) is a perfect square. A104776

Polynomial extrapolation of 2, 3, 5, 7, 11. A61165

Where records occur in A129385. A129387

a(n) = 42·n² - 1. A158626

Expansion of g.f. (2·x³ + 5) / ( -x⁵ + x³ + 1). A136598

Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 4. A296811

Number of n-bead necklaces labeled with numbers -2..2 not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2. A209109

a(n) is the integer part of rⁿ where r² = ∑_n>=1 1/a(n). A266331