Properties of the Number -364051

Three Hundred Sixty-Four Thousand Fifty-One

Basics

Value: -364052 → -364051 → -364050

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 73 × 4987

Divisors: 1, 73, 4987, 364051

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1011000111000010011

Octal: -1307023

Duodecimal: -156817

Hexadecimal: -58e13

Square: 132533130601

Square Root: 603.3663895180108

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 nX8 -1,1 arrays such that the sum over i=1..n,j=1..8 of i·x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute 8-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship). A225344

Number of 9Xn -1,1 arrays such that the sum over i=1..9,j=1..n of i·x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute n-across galley oarsmen left-right at 9 fore-aft positions so that there are no turning moments on the ship). A225349

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