Properties of the Number 13117

Thirteen Thousand One Hundred Seventeen

Basics

Value: 13116 → 13117 → 13118

Parity: odd

Prime: No

Previous Prime: 13109

Next Prime: 13121

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 13 × 1009

Divisors: 1, 13, 1009, 13117

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001100111101

Octal: 31475

Duodecimal: 7711

Hexadecimal: 333d

Square: 172055689

Square Root: 114.5294721894762

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 concatenation of n and 9n. A9474

Numbers k such that sopf(k) = (1/2)*(sopf(k+1) + sopf(k-1)), where sopf(x) = sum of the distinct prime factors of x. A75846

Numbers k such that (k / sum of digits of k) and (k+1 / sum of digits of k+1) are both prime. A85775

Number of compositions of n with distinct differences up to sign. A325552

Odd semiprimes k = p·q such that k = A325820(p,q), with p, q primes > 3, and A325820 is the carryless base-3 multiplication. A391331

Number of squares in the interior of the square with vertices (n,0), (0,n), (-n,0) and (0,-n) in a square (x,y)-grid. A111746

Indices of primes in A026007. A285223

Numbers that can be represented in more than one way as p²+p·q+q² with p and q primes, p<=q. A349987

Smallest multiple of n beginning with n and having a digit sum n, or 0 if no such number exists. A77727

For a string of letters of length k, say abc...def, let f(k) be the string of length k-1 consisting of the adjacent pairs ab, bc, cd, ..., de, ef. Given n, let U be the string of length 2n consisting of n 1's followed by n 2's: 11...122...2. Then a(n) is the number of the C(2n,n) permutations V of U such that f(U) and f(V) agree in exactly one place. A98813