Properties of the Number -75361

Seventy-Five Thousand Three Hundred Sixty-One

Basics

Value: -75362 → -75361 → -75360

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 13 × 17 × 31

Divisors: 1, 11, 13, 17, 31, 143, 187, 221, 341, 403

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10010011001100001

Octal: -223141

Duodecimal: -37741

Hexadecimal: -12661

Square: 5679280321

Square Root: 274.5195803581231

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

Carmichael numbers: composite numbers k such that a^k-1 == 1 (mod k) for every a coprime to k. A2997

Euler-Jacobi pseudoprimes: 2^(n-1/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol. A47713

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

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

Composite numbers k such that k == +-1 (mod 8) and 2^(k-1/2) == 1 (mod k). A6971

Base-3 Euler-Jacobi pseudoprimes. A48950

Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935. A52155

Pseudoprimes to bases 2, 3 and 5. A83737

Absolute Euler pseudoprimes: odd composite numbers n such that a^(n-1/2) == +-1 (mod n) for every a coprime to n. A33181

Carmichael numbers with exactly 4 prime factors. A74379