Properties of the Number -750325

Seven Hundred Fifty Thousand Three Hundred Twenty-Five

Basics

Value: -750326 → -750325 → -750324

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 ² × 30013

Divisors: 1, 5, 25, 30013, 150065, 750325

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10110111001011110101

Octal: -2671365

Duodecimal: -302271

Hexadecimal: -b72f5

Square: 562987605625

Square Root: 866.2130222987877

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 3 X n matrices containing a permutation of 1..3·n in increasing order rowwise, columnwise and (downwards) antidiagonally. A181197

Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component such that for each point (p₁,p₂,...,p_k) we have p₁<=p₂<=...<=p_k; square array A(n,k), n>=0, k>=0, read by antidiagonals. A227578

T(n,k) = number of n X k matrices containing a permutation of 1..n·k in increasing order rowwise, columnwise, diagonally and (downwards) antidiagonally. A181196

Number of n X 8 matrices containing a permutation of 1..n·8 in increasing order rowwise, columnwise, diagonally and (downwards) antidiagonally. A181195

Number of lattice paths from {n}⁶ to {0}⁶ using steps that decrement one component such that for each point (p₁,p₂,...,p₆) we have p₁<=p₂<=...<=p₆. A227597

Number of permutations of 0..floor((3·n-2)/2) on odd squares of an 3Xn array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing. A215871