Properties of the Number 13118

Thirteen Thousand One Hundred Eighteen

Basics

Value: 13117 → 13118 → 13119

Parity: even

Prime: No

Previous Prime: 13109

Next Prime: 13121

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 7 × 937

Divisors: 1, 2, 7, 14, 937, 1874, 6559, 13118

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001100111110

Octal: 31476

Duodecimal: 7712

Hexadecimal: 333e

Square: 172081924

Square Root: 114.53383779477574

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

Number of integer partitions of n of odd rank. A340692

Starts of runs of 3 consecutive Lucas-Niven numbers (A351714). A351716

Numbers k such that k | 6^k + 6. A15892

A sequence of asymptotic density ζ(9) - 1, where ζ is the Riemann ζ function. A143035

Numbers k such that k·6^k + 1 is prime. A242176

Number of primes between successive Lucas numbers. A52012

At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage. A56640

Diagonal sums of number array A082043. A82045

Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having k adjacent blocks (0 <= k <= n). An adjacent block is a block of the form (i, i+1, i+2, ...). A177254

Number of loopless rooted planar maps with 3 faces and n vertices and no isthmuses. Also a(n)=T(4,n-3), array T as in A049600. A6416