Properties of the Number -8959

Nine Hundred Fifty-Nine

Basics

Value: -8960 → -8959 → -8958

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 17 ² × 31

Divisors: 1, 17, 31, 289, 527, 8959

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10001011111111

Octal: -21377

Duodecimal: -5227

Hexadecimal: -22ff

Square: 80263681

Square Root: 94.65199416811038

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

Values of n such that L(10) and N(10) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227448

Smallest multiple of n whose digits sum to n. A2998

A sequence of asymptotic density ζ(9) - 1, where ζ is the Riemann ζ function. A143035

Square array A(n,k), read by descending antidiagonals, where A(1, k) = A388984(k), and for n > 1, A(n, k) = A003961(A(n-1), k). A388981

Odd composite integers m such that A003501(m-J(m,21)) == 2 (mod m) and gcd(m,21)=1, where J(m,21) is the Jacobi symbol. A339130

Divide odd numbers into groups with prime(n) elements and add together. A34960

Smallest number m larger than prime(n) such that prime(n) = sum of digits of m and prime(n) = largest prime factor of m (or 0 if no such number exists). A52022

Numbers n such that sum of digits of n equals the squarefree part of n. A70274

n-th positive integer whose digits sum up to n. A81927

n-th zerofree positive number with digital sum n. A181178