Properties of the Number -37595

Thirty-Seven Thousand Five Hundred Ninety-Five

Basics

Value: -37596 → -37595 → -37594

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 5 × 73 × 103

Divisors: 1, 5, 73, 103, 365, 515, 7519, 37595

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001001011011011

Octal: -111333

Duodecimal: -1990B

Hexadecimal: -92db

Square: 1413384025

Square Root: 193.89430110243055

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) = floor((n + 1/2)³). A219085

a(n) = floor(M(g(n-1)+1, ..., g(n))), where M = harmonic mean and g(n) = n³. A227012

T(n,k)=Number of nXk arrays of permutations of 0..n·k-1 with rows nondecreasing modulo 4 and columns nondecreasing modulo 5. A264698

a(n) = ∑_k=0..n S(k), where S(n) are the tribonacci generalized numbers A001644. A73728

Composite numbers n such that n+2 is also composite and such that (sopfr(n), sopfr(n+2)) is a twin prime pair. A001414 explains notation 'sopfr(n)'. A247048

Numbers k such that 2^2·k+1 + 2^k + 1 is prime. A105180

Number of 3Xn arrays of permutations of 0..n·3-1 with rows nondecreasing modulo 4 and columns nondecreasing modulo 5. A264700

Repeated application of the Syracuse map over F₂[x] starting from 1+x³, m = 1+x². Represented as the integers resulting from evaluating the polynomial at 2 over Z. A368120