Properties of the Number -30857

Thirty Thousand Eight Hundred Fifty-Seven

Basics

Value: -30858 → -30857 → -30856

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 59 × 523

Divisors: 1, 59, 523, 30857

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111100010001001

Octal: -74211

Duodecimal: -15A35

Hexadecimal: -7889

Square: 952154449

Square Root: 175.66160650523494

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

Euler pseudoprimes to base 3: composite integers such that abs(3^{(n - 1}/2)) == 1 mod n. A262051

a(n) = (3 + 2·n + 6·n² + 4·n³)/3. A166464

Odd numbers k > 1 such that gcd(3,k) = 1 and 3^(k-1/2) == -(3/k) (mod k), where (3/k) is the Jacobi symbol (or Kronecker symbol); Euler pseudoprimes to base 3 (A262051) that are not Euler-Jacobi pseudoprimes to base 3 (A048950). A375490

Strong pseudoprimes to base 9. A20235

Expansion of g.f. A(x) satisfying A(x) = 1 + x·A(x)/(1 - 2·x*A(x))². A365772

Terms of A122780 which are not Carmichael numbers A002997. A153514

Super pseudoprimes (or superpseudoprimes) to base 3: Fermat pseudoprimes to base 3 all of whose divisors that are larger than 1 are either primes or Fermat pseudoprimes to base 3. A328662

G.f.: x/exp( ∑_n>=1 a(n)*xⁿ/n ) = ∑_n>=1 moebius(n)*xⁿ. A195589

a(n) = ∑_k=1..n (k/gcd(n, k))³. A343513

Strong pseudoprimes to base 33. A20259