Properties of the Number -41341

Forty-One Thousand Three Hundred Forty-One

Basics

Value: -41342 → -41341 → -41340

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 41341

Divisors: 1, 41341

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1010000101111101

Octal: -120575

Duodecimal: -1BB11

Hexadecimal: -a17d

Square: 1709078281

Square Root: 203.32486321156102

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

Numbers n such that (6ⁿ + 1)/7 is a prime. A57172

Primes of the form abcabc..abcab. A228627

Smallest k such that A073734(k) = n, where A073734 is the GCD of consecutive terms of the EKG sequence A064413. A382222

Numerators of continued fraction convergents to sqrt(548). A42048

Consider sequence of fractions A066657/A066658 produced by ratios of terms in A066720; let m = smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A066720(m) = k; sequence gives values of m; set a(n) = -1 if some fraction i/n never appears. A66849

1, followed by list of numbers n such that the number of strong primes and the number of weak primes are equal at the n-th prime. A175102

Numerators of continued fraction convergents to sqrt(137). A41250

Primes p such that σ(k) = φ(prime(k)-1), where p = prime(k). A107815

Primes p containing the string "13" and sum of digits sod(p) = 13. A175017

Primes p such that the sum of the squares of digits of p equals the sum of digits of p². A290972