Properties of the Number -41941

Forty-One Thousand Nine Hundred Forty-One

Basics

Value: -41942 → -41941 → -41940

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 41941

Divisors: 1, 41941

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1010001111010101

Octal: -121725

Duodecimal: -20331

Hexadecimal: -a3d5

Square: 1759047481

Square Root: 204.79501947068928

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

Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d = 2, 4 or 6) and forming d-pattern = [6, 6, 4]; short d-string notation of pattern = [664]. A78858

Number of unimodal maps [1..n]->[0..3]. A223659

Home primes whose homeliness is greater than 5. A133965

Home primes whose homeliness is 6. A133966

Expansion of (2/(3·sqrt(1-4·z)-1+4·z))*((1-sqrt(1-4·z))/(2·z))^k with k=9. A172066

Honaker primes of the form p = 2·k-1 with sum-of-digits(p) = sum-of-digits(k). A176111

Greatest prime factor of n⁶+1. A240549

Primes p such that each of the numbers p^k for k=1..5 has exactly two 1s in its decimal representation. A175964

Let p_3,1(m) be the m-th prime == 1(mod 3). Then a(n) is the smallest p_3,1(m) such that the interval(p_3,1(m)*n, p_3,1(m+1)*n) contains exactly one prime == 1(mod 3). A210465

Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,4,2). A78966