Properties of the Number -5265

Two Hundred Sixty-Five

Basics

Value: -5266 → -5265 → -5264

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 5 × 13

Divisors: 1, 3, 5, 9, 13, 15, 27, 39, 45, 65

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1010010010001

Octal: -12221

Duodecimal: -3069

Hexadecimal: -1491

Square: 27720225

Square Root: 72.56031973468694

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

Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] ∏_m=1..n (x - m - r), with r = 3. A49459

G.f. A(x) satisfies A(x) = 1 + x/A(x)² * (1 - A(x) + A(x)³). A377705

Rhonda numbers to base 10. A99542

A(n,k) is the n-th Rhonda number to base A002808(k), the k-th composite number; square array A(n,k), n>=1, k>=1, read by antidiagonals. A291925

Numbers k for which nontrivial positive magic squares of exactly 8 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005. A125015

a(n) = 3·n*(n+6). A140681

Differences of two positive 4th powers. A147857

Heinz numbers of integer partitions whose length is equal to their LCM. A316429

a(n) = a(n-1) + a(m) for n >= 4, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 4. A50053

Stirling2 triangle with scaled diagonals (powers of 9). A75504