Properties of the Number -8958

Nine Hundred Fifty-Eight

Basics

Value: -8959 → -8958 → -8957

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 1493

Divisors: 1, 2, 3, 6, 1493, 2986, 4479, 8958

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10001011111110

Octal: -21376

Duodecimal: -5226

Hexadecimal: -22fe

Square: 80245764

Square Root: 94.64671151181112

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 the difference d for 5 primes in arithmetic progression with the minimal start sequence {5 + j·d}, j = 0 to 4. A206039

Number of ways to write n as an ordered sum of 9 squares of positive integers. A340946

Numbers which are the sum of their proper divisors containing the digit 9. A59468

The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts. A102186

Numbers k such that S(k+2) = d(k)+2, where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005). A73535

Trajectory of 7 under repeated application of the map in A185452. A185455

The 5x + 1 sequence beginning at 7. A28389

Larger terms of the pairs (a < b) in the sequence {a,b}-> {Max[{a,b}]-Min[{a,b}],k·Min[{a,b}]} with k=3 and the first pair {a=1,b=2}. See A075256. A75258

Number of mobiles (circular rooted trees) with n nodes and 3 leaves. A55341

Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059. A63058