Properties of the Number 68260

Sixty-Eight Thousand Two Hundred Sixty

Basics

Value: 68259 → 68260 → 68261

Parity: even

Prime: No

Previous Prime: 68239

Next Prime: 68261

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 5 × 3413

Divisors: 1, 2, 4, 5, 10, 20, 3413, 6826, 13652, 17065

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000101010100100

Octal: 205244

Duodecimal: 33604

Hexadecimal: 10aa4

Square: 4659427600

Square Root: 261.2661478263114

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) = F(n+1) + L(n), where F(n) and L(n) are Fibonacci and Lucas numbers, respectively. A13655

a(n) = a(n-1) + a(n-2) with a(0)=2, a(1)=5. Sometimes called the Evangelist Sequence. A1060

Values of·in the solutions to x² - 3xy + y² + 11 = 0, where 0 < x < y. A237132

2nd-largest term in n-th row of Stern's diatomic triangle A002487. A244472

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1)*b(n), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296272

Numbers k(n) used for Markoff forms determining quadratic irrationals with purely periodic continued fractions. A305311

s(k)-s(j), where the pairs (k,j) are given by A205877 and A205878, and s(k) denotes the (k+1)-st Fibonacci number. A205879

a(1)=2, a(2)=3, then a(n)=a(n-1)+a(n-2) if n odd, a(n)=a(n-1)-a(n-2) if n even. A174562

a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 1,2,4. A49870

a(n) is the smallest number k such that k²+1 divided by its largest prime factor is equal to F(2·n-1) for n > 0, or 0 if no such k exists, where F(n) is the Fibonacci sequence. A339315