Properties of the Number -432073

Four Hundred Thirty-Two Thousand Seventy-Three

Basics

Value: -432074 → -432073 → -432072

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 432073

Divisors: 1, 432073

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1101001011111001001

Octal: -1513711

Duodecimal: -18A061

Hexadecimal: -697c9

Square: 186687077329

Square Root: 657.322599641911

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) = ∑_k=0..n-1 binomial(n-1,k)*binomial(n+k,k). Also a(n) = T(n,n), array T as in A049600. A47781

a(n) = n*(2·n⁸ + 84·n⁶ + 798·n⁴ + 1636·n² + 315)/2835. A99196

Number of paths from (0,0) to the line x = n, each segment given by a vector (1,1), (1,-1), or (2,0), not crossing the x-axis, and including no horizontal segment on the x-axis. A247623

Array read by antidiagonals: the number of directed elements with area n on the lattice T_2k+1. A296129

Crystal ball sequence for the lattice C₉. A305723

Triangle read by rows: T(n,k) is the number of bicolored Dyck paths of semilength n and having k peaks of the form ud (0 <= k <= n). A bicolored Dyck path is a Dyck path in which each up-step is of two kinds: u and U. A114608

a(1)=433640083; a(n+1)= the largest prime factor of a(n)+b(n)+c(n), where a(n)<b(n)<c(n) and a(n),b(n) and c(n) are three consecutive primes. A117631

Triangle read by rows, T(n, k) = (-1)^n-k*binomial(n,k)*hypergeom([k - n, n + 1], k + 1, 2), for n >= 0 and 0 <= k <= n. A297898