Properties of the Number -4312

Three Hundred Twelve

Basics

Value: -4313 → -4312 → -4311

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 7 ² × 11

Divisors: 1, 2, 4, 7, 8, 11, 14, 22, 28, 44

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000011011000

Octal: -10330

Duodecimal: -25B4

Hexadecimal: -10d8

Square: 18593344

Square Root: 65.66582063752801

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

a(n) = numerator of r(n): r(n) is such that the continued fraction (of rational terms) [r(1);r(2),...,r(n)] = n², for every positive integer n. A128560

a(n) = ∑_d∣n μ(d) * binomial(d+n/d-1, d). A338657

Coordination sequence for "svh" 3D uniform tiling. A299283

Coreful perfect numbers: numbers k such that csigma(k) = 2·k, where csigma(k) is the sum of the coreful divisors of k (A057723). A307958

Decimal representation of permutations of lengths 1, 2, 3, ... arranged lexicographically. A30299

Number T(n,k) of tilings of a 3k X n rectangle with right trominoes. A351322

Concentric 22-gonal numbers. A195149

Numbers of the form 9·h² + 2·h, for h an integer. A132355

Square array a(m,n) read by antidiagonals, defined by A000010(n)*a(m,n) = ∑_{k=1..n, gcd(k,n)=1} m^{∑_d∣n A000010(d)/ (multiplicative order of k modulo d)}. A132191

Number T(n,k) of permutations p of [n] with no fixed points where the maximal displacement of an element equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A259784