Properties of the Number -38236

Thirty-Eight Thousand Two Hundred Thirty-Six

Basics

Value: -38237 → -38236 → -38235

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 11 ² × 79

Divisors: 1, 2, 4, 11, 22, 44, 79, 121, 158, 242

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001010101011100

Octal: -112534

Duodecimal: -1A164

Hexadecimal: -955c

Square: 1461991696

Square Root: 195.54027718094295

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) is the largest integer k such that there is an integer m with exactly n nonunitary prime factors and m + A005117(i) is squarefree for 1 <= i <= k. A390138

T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 12 and no adjacent elements equal. A234412

Expansion of (1/x) * Series_Reversion( x * (1-x)³ * (1-x³)³ ). A369301

One-fourth of the total number of edges in the graph (see A392172) formed when n points are placed in general position on each edge of a square and a chord is drawn from each point to the 3·n points on the other three sides. A392174

a(n) = 2*(3·n+1)*(9·n+8). A304506

a(n) = number of primes < n⁴. A380331

Number of (n+1)X(2+1) 0..6 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 12 and no adjacent elements equal. A234407

a(n) = n² * prime(n). A356868