Properties of the Number -170957

One Hundred Seventy Thousand Nine Hundred Fifty-Seven

Basics

Value: -170958 → -170957 → -170956

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 170957

Divisors: 1, 170957

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -101001101111001101

Octal: -515715

Duodecimal: -82B25

Hexadecimal: -29bcd

Square: 29226295849

Square Root: 413.4694668291723

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

Increasing sequence of primes p such that all of 2,3,5,...,prime(n) are primitive roots mod p. A213052

Let p = n-th odd prime. Then a(n) = least prime congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p. A1992

Let p = n-th odd prime. Then a(n) = least positive integer congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p. A94847

Records in A094847. A94849

Records in A001992. A94852

a(n) gives least prime for which the n-th prime is the least prime which is not a primitive root of a(n) (see A060084), or 0 if the n-th prime never occurs in A060084. A60085

Primes of the form (p*(q-1) + (p-1)*q)/2, where p and q are consecutive odd primes. A99911

Least prime p such that the first n primes are not squares mod p. A191089

a(n) is the least prime p = prime(k) > prime(n) such that A306530(k) = prime(n). A307965

a(n) = (A242804(n)-9)/12. A257044