Properties of the Number -4190

One Hundred Ninety

Basics

Value: -4191 → -4190 → -4189

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 419

Divisors: 1, 2, 5, 10, 419, 838, 2095, 4190

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000001011110

Octal: -10136

Duodecimal: -2512

Hexadecimal: -105e

Square: 17556100

Square Root: 64.73020933072904

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

Smallest even k such that the pair {k-3,k-1} is not a twin prime pair and lpf(k-1) > lpf(k-3) >= prime(n), where lpf = least prime factor (A020639). A242720

a(n) = a(n-1) + a(n-8), with a(i) = 1 for i = 0..7. A5710

Inverse Moebius transform of powers of 2. A55895

Total sum of even parts in all partitions of n. A66966

Smallest even number k such that lpf(k-3) = prime(n) while lpf(k-1) > lpf(k-3), where lpf=least prime factor (A020639). A242490

a(n) = ∑_k=1..n T(n,k), array T as in A049790. A49791

Connell (3,5)-sum sequence (partial sums of the (3,5)-Connell sequence). A122796

Total sum of the sums of all positive k-th ranks of all partitions of n. A208483

Number of strict integer partitions of n with distinct first quotients. A342520

Number of ways to write n as the root-mean-square (RMS) of a set of distinct primes. A163974