Properties of the Number -512461

Five Hundred Twelve Thousand Four Hundred Sixty-One

Basics

Value: -512462 → -512461 → -512460

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 31 × 61 × 271

Divisors: 1, 31, 61, 271, 1891, 8401, 16531, 512461

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -1111101000111001101

Octal: -1750715

Duodecimal: -208691

Hexadecimal: -7d1cd

Square: 262616276521

Square Root: 715.8638138640617

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

3-Carmichael numbers: Carmichael numbers equal to the product of 3 primes: k = p·q*r, where p < q < r are primes such that a^k-1 == 1 (mod k) if a is prime to k. A87788

Primary Carmichael numbers. A324316

a(n) = n⁴ - n³ + n² - n + 1. A60884

a(n) = sigma₆(n²)/sigma₃(n²). A84220

Pseudoprimes to bases 2, 3 and 5. A83737

Composite numbers n such that gcd(φ(n), n-1) = λ(n), where λ(n) = A002322(n). A264012

Carmichael numbers ending in 1. A354609

Pseudoprimes to bases 2, 3, 5 and 7. A83739

Imprimitive Carmichael numbers: Carmichael numbers m such that if m = p₁ * p₂ * ... *p_k is the prime factorization of m then g(m) = gcd(p₁ - 1, ..., p_k - 1) > sqrt(λ(m)), where λ is the Carmichael λ function (A002322). A328935