Properties of the Number -14093

Fourteen Thousand Ninety-Three

Basics

Value: -14094 → -14093 → -14092

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 17 × 829

Divisors: 1, 17, 829, 14093

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11011100001101

Octal: -33415

Duodecimal: -81A5

Hexadecimal: -370d

Square: 198612649

Square Root: 118.71394189394942

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

Values of n such that L(20) and N(20) 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. A227523

Number of multigraphs with 4 nodes and n edges. A3082

Numbers b > 1 such that the smallest four primes, i.e., 2, 3, 5 and 7 are base-b Wieferich primes. A339533

Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) is not a part of p. A241736

Number of points in Zⁿ of norm <= 2. A55426

a(n) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly 2 ways, or -1 if no such number exists. A374287

Convergent of an infinite product of Pascal's triangles aerated by rows. A161869

M-type rooted trees on n nodes. A52315

a(n) = floor((concatenation of next (n+1) numbers) / (concatenation of next n numbers)). A77146

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 430", based on the 5-celled von Neumann neighborhood. A272116