Properties of the Number 1265

One Thousand Two Hundred Sixty-Five

Basics

Value: 1264 → 1265 → 1266

Parity: odd

Prime: No

Previous Prime: 1259

Next Prime: 1277

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 11 × 23

Divisors: 1, 5, 11, 23, 55, 115, 253, 1265

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10011110001

Octal: 2361

Duodecimal: 895

Hexadecimal: 4f1

Square: 1600225

Square Root: 35.566838487557476

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 of rooted trees with n vertices in which vertices at the same level have the same degree. A3238

Partial sums of A299274. A299275

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is Euler transform of (j->k). A144064

Partial sums of primes, if 1 is regarded as a prime (as it was until quite recently, see A008578). A14284

5 times triangular numbers: a(n) = 5·n*(n+1)/2. A28895

Binomial transform of Fine's sequence A000957: 1, 0, 1, 2, 6, 18, 57, 186, ... A33321

a(n) = n*(n+9)/2. A56000

Numbers m such that there are precisely 3 groups of order m. A55561

Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0) = 1, T(n,k) = 0 if n<k, T(n,0) = T(n-1,0) + T(n-1,1) and for k >= 1: T(n,k) = T(n-1,k-1) + x·T(n-1,k) + T(n-1,k+1) with x = 3. A110877

Primitively primeshift-abundant numbers: Numbers that are included in A246282 (k with A003961(k) > 2k), but none of whose proper divisors are. A337372