Properties of the Number -3798

Seven Hundred Ninety-Eight

Basics

Value: -3799 → -3798 → -3797

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 211

Divisors: 1, 2, 3, 6, 9, 18, 211, 422, 633, 1266

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111011010110

Octal: -7326

Duodecimal: -2246

Hexadecimal: -ed6

Square: 14424804

Square Root: 61.62791575252241

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

G.f.: ∏_k>=1 (1 + 2·x^k). A32302

Numbers n such that Bernoulli number B_n has denominator 798. A272138

Numbers m such that there are precisely 16 groups of order m. A295161

Non-deficient numbers with even σ which are not Zumkeller. A171641

Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the generalized pattern 12-3; triangle T(n,k), n>=0, 0<=k<=(n-1)*(n-2)/2-[n=0], read by rows. A260665

Number of integer partitions of n where the parts have the same mean as the distinct parts. A360243

Number of ways of writing n as a sum of 9 nonnegative cubes. A173682

Number of 6-line partitions of n (i.e., planar partitions of n with at most 6 lines). A225196

Coefficients of the '6th-order' mock θ function 2 μ(q). A53273

T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock summing to 2 3 4 5 6 7 8 9 or 10. A251524