Properties of the Number 17264

Seventeen Thousand Two Hundred Sixty-Four

Basics

Value: 17263 → 17264 → 17265

Parity: even

Prime: No

Previous Prime: 17257

Next Prime: 17291

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁴ × 13 × 83

Divisors: 1, 2, 4, 8, 13, 16, 26, 52, 83, 104

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100001101110000

Octal: 41560

Duodecimal: 9BA8

Hexadecimal: 4370

Square: 298045696

Square Root: 131.39254164525474

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) = 4·a(n-1) + 2·a(n-2) for n>1, a(0)=1, a(1)=2. A84059

Smallest a(n) > a(n-1) such that a(n)²+a(n-1)² is a perfect square, with a(1)=5. A76671

Number of unrooted achiral trees with n nodes. A3244

T(n,0) + T(n,1) + ... + T(n,n), T given by A026648. A26655

Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k returns to the horizontal axis (both from above and below). The members of L_n are paths of weight n that start at (0,0) , end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A182898

Number of idempotent 3X3 0..n matrices. A222822

a(n) = ((1 + sqrt(15))ⁿ - (1 - sqrt(15))ⁿ)/sqrt(15). A277091

Number of partitions satisfying cn(0,5) + cn(2,5) <= cn(1,5) + cn(4,5) and cn(0,5) + cn(3,5) <= cn(1,5) + cn(4,5). A39887

Smallest a(n)>a(n-1) such that a(n)²+a(n-1)² is a perfect square, a(1)=9. A76674

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (1, -1, 0), (1, -1, 1), (1, 0, 1)}. A148348