Properties of the Number -389

Three Hundred Eighty-Nine

Basics

Value: -390 → -389 → -388

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 389

Divisors: 1, 389

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: -110000101

Octal: -605

Duodecimal: -285

Hexadecimal: -185

Square: 151321

Square Root: 19.72308292331602

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) = nearest integer to n² * sin(sqrt(n)). A274088

Take alternate terms of A274088 and A274090. A274091

a(n) = nearest integer to k²*sin(sqrt(k)+j*π/2) where n = 3·k+j, 0<=j<3. A274092

G.f.: Im((i·x; x)_inf), where (a; q)_inf is the q-Pochhammer symbol, i = sqrt(-1). A292043

a(n) = -n² + 9·n + 53. A126665

Smallest error in trying to solve n³ = x³ + y³. That is, for each n, find positive integers x <= y < n such that | n³ - x³ - y³ | is minimal and let a(n) := n³ - x³ - y³. A135998

Inverse binomial transform of A014217. A142585

Expansion of (1/x) * Series_Reversion( x*(1-x)/(1-x-x⁴) ). A366087

a(n) = n! * ∑_{k=0..floor(n/2)} (-1)^k / (n-2·k)!. A337749

For 1<=x<=n, 1<=y<=n, with gcd(x,y)=1, write 1 = gcd(x,y) = u·x+v·y with u,v minimal; a(n) = sum of the values of u+v. A345425