Properties of the Number 12217

Twelve Thousand Two Hundred Seventeen

Basics

Value: 12216 → 12217 → 12218

Parity: odd

Prime: No

Previous Prime: 12211

Next Prime: 12227

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 19 × 643

Divisors: 1, 19, 643, 12217

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10111110111001

Octal: 27671

Duodecimal: 70A1

Hexadecimal: 2fb9

Square: 149255089

Square Root: 110.53053876644228

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 T(n,k) of entries in the k-th cycles of all permutations of {1,2,..,n}; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements. A185105

Numbers k such that the concatenation of k with k-8 gives a square. A115435

Start with a single hexagon; at n-th generation add a hexagon at each expandable vertex; a(n) is the sum of all label values at n-th generation. (See comment for construction rules.) A247620

a(1) = 932; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1). A105213

Numbers k such that k concatenated with k-9 gives the product of two numbers which differ by 2. A116095

Triangle read by rows: T(m,n) (1 <= n < m) is the number of moves of an (m,n)-leaper (a generalization of a chess knight) until it can no longer move, starting on a board with squares spirally numbered from 1. Each move is to the lowest-numbered unvisited square. T(m,n) = -1 if the path never terminates. A323749

Index sequence for limit-reversing A000002; see Comments. A245937

Number of entries in the n-th cycles of all permutations of [2n]. A285239

Expansion of ∏_m>=1 (1 + m·q^m)¹⁹. A22647

E.g.f. exp(x)*(Bessel_I(0,2·sqrt(2)x) + Bessel_I(1,2·sqrt(2)x)/sqrt(2)). A119975