Properties of the Number -12183

Twelve Thousand One Hundred Eighty-Three

Basics

Value: -12184 → -12183 → -12182

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 31 × 131

Divisors: 1, 3, 31, 93, 131, 393, 4061, 12183

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10111110010111

Octal: -27627

Duodecimal: -7073

Hexadecimal: -2f97

Square: 148425489

Square Root: 110.37662796081425

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

Toothpick sequence in the three-dimensional grid. A160160

Number of connected graphs with n edges with loops allowed. A191970

Number of compositions of n such that no part equals any of its two immediate predecessors. A261962

G.f.: exp( ∑_n>=1 (xⁿ/n) * ∏_d∣n (1 + d·xⁿ) ). A205478

Number of nonisomorphic connected functions with no fixed points, or proper rings with n edges. A2862

Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1. A96024

The E₆-Eulerian numbers. A273000

Minimal k > n such that (4·k+3·n) * (4·n+3·k) is a square. A83752

Numbers that match polynomials over {0,1} that have a factor containing -3 as a coefficient; see Comments. A208182

a(n) = n OR n³ (applied to binary expansions). A8468