Properties of the Number -38238

Thirty-Eight Thousand Two Hundred Thirty-Eight

Basics

Value: -38239 → -38238 → -38237

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 6373

Divisors: 1, 2, 3, 6, 6373, 12746, 19119, 38238

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001010101011110

Octal: -112536

Duodecimal: -1A166

Hexadecimal: -955e

Square: 1462144644

Square Root: 195.54539114998337

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

Number of polyominoes with n cells that tile the plane isohedrally. A75205

T(n,k)=Number of nXk 0..1 arrays with exactly floor(nXk/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..1 order. A222328

a(n) = ∑_k=3..n binomial(k,3) * floor(n/k). A366971

Numbers in A007504 such that ω(a(n)) = ω(a(n)) = 3. A264885

Average of a twin prime pair which is the sum of the first k primes, for some k. A366205

Number of nX6 0..1 arrays with exactly floor(nX6/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..1 order. A222326

Terms of A007504 divisible by 3. A249679

Number of n X n 0..1 arrays with exactly floor(n X n/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..1 order. A222321

We use cookies

Some cookies are essential for Natory to function, like keeping you signed in. We also use optional cookies to understand how the app is used and improve it over time. Learn more in our Privacy Policy. You can manage your preferences anytime.