Properties of the Number -37237

Thirty-Seven Thousand Two Hundred Thirty-Seven

Basics

Value: -37238 → -37237 → -37236

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 23 × 1619

Divisors: 1, 23, 1619, 37237

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001000101110101

Octal: -110565

Duodecimal: -19671

Hexadecimal: -9175

Square: 1386594169

Square Root: 192.96890941288962

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) = least k such that the remainder when 31^k is divided by k is n. A128371

Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {p(i)-i, i=1,2,...,n} has exactly k elements (1<=k<=n). A125182

Smallest k such that (10ⁿ+k, 10ⁿ+k+2) and (10ⁿ⁺¹+k, 10ⁿ⁺¹+k+2) are two pairs of twin primes with k(n+1) > k(n). A224846

Smallest k such that (10ⁿ+k, 10ⁿ+k+2) and (10ⁿ⁺¹+k, 10ⁿ⁺¹+k+2) are two pairs of twin primes. A224905

Number of base 31 circular n-digit numbers with adjacent digits differing by 6 or less. A125419

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (1, -1, 0), (1, 0, 1), (1, 1, 1)}. A150717

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (1, 0, -1), (1, 1, 0), (1, 1, 1)}. A150718

a(n) = (n + 1)*(6·n² + 15·n + 4)/2. A269232