Properties of the Number -6305

Three Hundred Five

Basics

Value: -6306 → -6305 → -6304

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 13 × 97

Divisors: 1, 5, 13, 65, 97, 485, 1261, 6305

Polygonal

Triangular: No

Square: No

Pentagonal: Yes

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1100010100001

Octal: -14241

Duodecimal: -3795

Hexadecimal: -18a1

Square: 39753025

Square Root: 79.40403012442127

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

Expansion of exp( ∑_n>=1 -sigma₉(n)*xⁿ/n ) in powers of x. A283339

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of ∏_j>=1 (1 - j^k*x^j)^j. A294580

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of ∏_j>=1 (1 - j^k*x^j)^{j^k}. A294583

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of ∏_j>=1 (1 - j·x^j)^{j^k}. A294587

Values of n such that L(18) and N(18) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227521

a(n) = 3ⁿ - 2ⁿ. A1047

Number of n X 8 binary arrays with a path of adjacent 1's and no path of adjacent 0's from top row to bottom row. A69428

Square array of nexus numbers a(n,k) = (n+1)^k+1 - n^k+1 (n >= 0, k >= 0) read by upwards antidiagonals. A47969

Triangle read by rows: 2-Stirling numbers of the second kind. A143494

Numbers m that are the hypotenuse of exactly 13 distinct integer-sided right triangles, i.e., m² can be written as a sum of two squares in 13 ways. A97102