Properties of the Number 1260

One Thousand Two Hundred Sixty

Basics

Value: 1259 → 1260 → 1261

Parity: even

Prime: No

Previous Prime: 1259

Next Prime: 1277

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 5 × 7

Divisors: 1, 2, 3, 4, 5, 6, 7, 9, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10011101100

Octal: 2354

Duodecimal: 890

Hexadecimal: 4ec

Square: 1587600

Square Root: 35.4964786985977

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: Yes

Taxicab Number: No

Super Prime: No

Friedman Number: Yes

Fermat Number: No

Cullen Number: No

OEIS Sequences

Expansion of ∏_{m >= 1} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts. A9

Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1). A2378

Least integer of each prime signature A124832; also products of primorial numbers A002110. A25487

Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record. A2182

Smallest number with exactly n divisors. A5179

Primorial inflation of n: Fully multiplicative with a(p) = p# for prime p, where x# is the primorial A034386(x). A108951

Triangle formed from even-numbered columns of triangle of expansions of powers of·in terms of Chebyshev polynomials U_n(x). A39599

a(n) = smallest integer with factorization as Product p(i)^e(i) such that Product p(e(i)) = n. A181821

Triangle T(n,k) read by rows: multinomial coefficients for the partitions of n listed in Abramowitz-Stegun order, 1 <= k <= A000041(n). A36038

Superabundant [or super-abundant] numbers: n such that σ(n)/n > σ(m)/m for all m < n, σ(n) being A000203(n), the sum of the divisors of n. A4394