Properties of the Number -3832

Eight Hundred Thirty-Two

Basics

Value: -3833 → -3832 → -3831

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 479

Divisors: 1, 2, 4, 8, 479, 958, 1916, 3832

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111011111000

Octal: -7370

Duodecimal: -2274

Hexadecimal: -ef8

Square: 14684224

Square Root: 61.90315016216864

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

Partial sums of primes, if 1 is regarded as a prime (as it was until quite recently, see A008578). A14284

Number of fixed n-celled polyominoes which need only touch at corners. A6770

Sum of gcd(x, y) for 1 <= x, y <= n. A18806

a(n) = a(n-1) + a(m) for n >= 3, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = 3. A50069

Positive numbers whose product of digits is 9 times their sum. A62041

T(n,k)=Number of length n+4 0..k arrays with no five consecutive elements with pattern ababa or abbba (possibly a=b) and new values 0..k introduced in 0..k order. A244185

Sophie Germain 4-almost primes. A111176

T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235098

Numbers k such that k¹⁰ == 1 (mod 11³). A56085

Expansion of ∏_k>=1 1/(1-x^k²)^k. A285047