Properties of the Number -410041

Four Hundred Ten Thousand Forty-One

Basics

Value: -410042 → -410041 → -410040

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 41 × 73 × 137

Divisors: 1, 41, 73, 137, 2993, 5617, 10001, 410041

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1100100000110111001

Octal: -1440671

Duodecimal: -179361

Hexadecimal: -641b9

Square: 168133621681

Square Root: 640.3444385641216

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

Pseudoprimes to bases 2, 3 and 5. A83737

Carmichael numbers k for which A053575(k) [the odd part of φ] divides k-1. A339869

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

Devaraj numbers: squarefree r-prime-factor (r>1) integers N=p1*...*pr such that φ(N)=(p1-1)*...*(pr-1) divides gcd(p1-1,...,pr-1)²*(N-1)^r-2. A104016

a(n) is the smallest Carmichael number (A002997) divisible by the n-th prime, or 0 if no such number exists. A135721

Carmichael numbers (A002997) that are not absolute Euler pseudoprimes (A033181). A262043