Properties of the Number -41749

Forty-One Thousand Seven Hundred Forty-Nine

Basics

Value: -41750 → -41749 → -41748

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 83 × 503

Divisors: 1, 83, 503, 41749

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010001100010101

Octal: -121425

Duodecimal: -201B1

Hexadecimal: -a315

Square: 1742979001

Square Root: 204.3257203584512

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

The q-exponential of x, e_q(x,q), evaluated at q = -x. A152398

Bases b where exactly eight primes p with p < b exist such that p is a base-b Wieferich prime. A325884

Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times the search for an element exchangeable with a_j has to be started. A79752

Number of (2+1)X(n+1) arrays of permutations of 0..n·3+2 with each element having directed index change 0,1 0,-1 -2,0 or 1,1. A264879

Numbers k such that A360331(k) = A360331(k+1). A360359

Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-1,0,1,2}. A79982

Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=0, k=1 and l=-1. A176759