Properties of the Number -12365

Twelve Thousand Three Hundred Sixty-Five

Basics

Value: -12366 → -12365 → -12364

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 2473

Divisors: 1, 5, 2473, 12365

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11000001001101

Octal: -30115

Duodecimal: -71A5

Hexadecimal: -304d

Square: 152893225

Square Root: 111.19802156513397

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 inequivalent ways (mod D₄) a pair of checkers can be placed on an n X n board. A14409

a(n) = (4·n³ - 12·n² + 14·n + 3)/3. A161703

a(n) is the smallest k such that a unique product of distinct terms of A050376 which is equal to k! contains at least the first n terms of A050376. A240695

List of codewords in binary lexicode with Hamming distance 6 written as decimal numbers. A75934

Number of subsequences of {1..n} such that all differences of pairs of terms are distinct (i.e., number of Golomb rulers on {1..n}). A54578

Basis for code in A075934. A75935

Number of rooted 2-connected 4-regular maps on the projective plane, which may have loops, with n inner faces. A318102

E.g.f. satisfies A(x) = 1 + x·exp(-x)*A(x)³. A365010

Coordination sequence for σ-CrFe, Position Xc. A9961

Array T(m,n) = greatest k such that 1/n + ... + 1/(n+k-1) <= m, by rising antidiagonals. A214966