Properties of the Number 260

Two Hundred Sixty

Basics

Value: 259 → 260 → 261

Parity: even

Prime: No

Previous Prime: 257

Next Prime: 263

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 5 × 13

Divisors: 1, 2, 4, 5, 10, 13, 20, 26, 52, 65

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100000100

Octal: 404

Duodecimal: 198

Hexadecimal: 104

Square: 67600

Square Root: 16.1245154965971

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

Moser-de Bruijn sequence: sums of distinct powers of 4. A695

a(n) = sigma₂(n): sum of squares of divisors of n. A1157

Abundant numbers (sum of divisors of m exceeds 2m). A5101

Generalized pentagonal numbers: m*(3·m - 1)/2, m = 0, +-1, +-2, +-3, .... A1318

Fibbinary numbers: if n = F(i1) + F(i2) + ... + F(ik) is the Zeckendorf representation of n (i.e., write n in Fibonacci number system) then a(n) = 2^{i1 - 2} + 2^{i2 - 2} + ... + 2^{ik - 2}. Also numbers whose binary representation contains no two adjacent 1's. A3714

Numbers k such that k² + 1 is prime. A5574

c-squarefree numbers: positive integers which in binary are concatenation of distinct parts of the form 10...0 with nonnegative number of zeros. A233564

Pillai's arithmetical function: ∑_k=1..n gcd(k, n). A18804

a(n) = n*(n² + 1)/2. A6003

Zumkeller or integer-perfect numbers: numbers n whose divisors can be partitioned into two disjoint sets with equal sum. A83207