Properties of the Number -14192

Fourteen Thousand One Hundred Ninety-Two

Basics

Value: -14193 → -14192 → -14191

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁴ × 887

Divisors: 1, 2, 4, 8, 16, 887, 1774, 3548, 7096, 14192

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11011101110000

Octal: -33560

Duodecimal: -8268

Hexadecimal: -3770

Square: 201412864

Square Root: 119.13018089468345

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) = |{m : multiplicative order of 10 mod m is equal to n}|. A59892

T(n,k)=Number of length n+k 0..3 arrays with at most two downsteps in every k consecutive neighbor pairs. A255660

Number of partitions of order n avoiding the consecutive pattern 231'1. A177476

Triangle T(n,k) read by rows giving number of fixed 4 X k polyominoes with n cells (n >= 4, 1<=k<=n-3). A59680

Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of alternating anagrams on n letters (of length 2n) which are decomposable into at most k slices. A239894

G.f. satisfies A(x) = 1 + x/(1 - x³)² * A(x/(1 - x³)). A360892

Integers that do not appear in A103502. A103504

Number of n X 3 arrays with each row a permutation of 1..3 having at least as many downsteps as the preceding row, with rows in lexicographically nonincreasing order. A222001

E.g.f. satisfies A(x) = exp( 2·x*A(x) / (1+x) ). A361213

Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x. A47826