Properties of the Number -37348

Thirty-Seven Thousand Three Hundred Forty-Eight

Basics

Value: -37349 → -37348 → -37347

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 9337

Divisors: 1, 2, 4, 9337, 18674, 37348

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001000111100100

Octal: -110744

Duodecimal: -19744

Hexadecimal: -91e4

Square: 1394873104

Square Root: 193.25630649476875

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

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 541", based on the 5-celled von Neumann neighborhood. A282986

Number of (w,x,y) with all terms in {0,...,n} and w ≠ max(|w-x|,|x-y|,|y-w|). A213498

Starts of runs of 3 consecutive numbers that have an equal number of unitary and nonunitary prime divisors (A348097). A348099

Diagonal sums of number triangle A113582. A154324

Number of (n+2)X(5+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A252808

Recamán's Fibonacci variation : a(1)=a(2)=1 then a(n) = a(n-1)+a(n-2)-F(n) if that number is >0 and not already in the sequence; a(n) = a(n-1)+a(n-2)+F(n) otherwise where F(n) denotes the n-th Fibonacci number. A91484