Properties of the Number -41789

Forty-One Thousand Seven Hundred Eighty-Nine

Basics

Value: -41790 → -41789 → -41788

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 11 × 29 × 131

Divisors: 1, 11, 29, 131, 319, 1441, 3799, 41789

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010001100111101

Octal: -121475

Duodecimal: -20225

Hexadecimal: -a33d

Square: 1746320521

Square Root: 204.42357985320578

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

Expansion of φ(x²) / f(-x) in powers of·where φ(), f() are Ramanujan θ functions. A226622

Consider a non-palindromic number of k digits n = d_k*10^k-1 + d_k-1*10^k-2 + … + d₂*10 + d₁. Sequence lists the numbers n such that ∑_i=1..k-1{φ(∑_j=1..i{d_j*10^j-1})} = ∑_i=1..k-1{φ(∑_j=1..i{d_k-j+1*10^i-j})} (see example below). A241503

a(n) = 2·A079500(n) - A079500(n+1). A188541

Nonnegative values·of solutions (x, y) to the Diophantine equation x² + (x+511)² = y². A207078

a(n) = ∑_{1 <= x₁, x₂, x₃ <= n} gcd(x₁, x₂, n)/gcd(x₁, x₂, x₃, n). A373061

Numbers k such that k![12]+2 is prime, where k![12] is the twelve-fold multifactorial. A283594