Properties of the Number -456033

Four Hundred Fifty-Six Thousand Thirty-Three

Basics

Value: -456034 → -456033 → -456032

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 71 × 2141

Divisors: 1, 3, 71, 213, 2141, 6423, 152011, 456033

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1101111010101100001

Octal: -1572541

Duodecimal: -19BAA9

Hexadecimal: -6f561

Square: 207966097089

Square Root: 675.3021545945193

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 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

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

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₄. A227583

Number of lattice paths from {4}ⁿ to {0}ⁿ using steps that decrement one component such that for each point (p₁,p₂,...,p_n) we have p₁<=p₂<=...<=p_n. A227584