Properties of the Number -1744436

Seven Hundred Forty-Four Thousand Four Hundred Thirty-Six

Basics

Value: -1744437 → -1744436 → -1744435

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 109 × 4001

Divisors: 1, 2, 4, 109, 218, 436, 4001, 8002, 16004, 436109

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -110101001111000110100

Octal: -6517064

Duodecimal: -701618

Hexadecimal: -1a9e34

Square: 3043056958096

Square Root: 1320.770986961782

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) = 2^2·n+1 - binomial(2·n+1, n+1). A346

a(n) = 2^n-1 - ((1+(-1)ⁿ)/4)*binomial(n, n/2). A58622

a(n) = 2^n-1 + ((1+(-1)ⁿ)/4)*binomial(n, n/2) - binomial(n, floor(n/2)). A294175

a(n) = ∑_k=0..10 binomial(n,k). A8863

a(n) = 2ⁿ - binomial(n, floor(n/2)). A45621

Triangle read by rows: T(n,g) is the number of rooted maps with n edges and 2 faces on an orientable surface of genus g. A270406

Chvatal conjecture for radius of graph of maximal intersecting sets. A7008

Number of horizontal segments in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0)-steps at positive heights; a horizontal segment is a maximal sequence of consecutive (1,0)-steps). A191391