Properties of the Number 41943

Forty-One Thousand Nine Hundred Forty-Three

Basics

Value: 41942 → 41943 → 41944

Parity: odd

Prime: No

Previous Prime: 41941

Next Prime: 41947

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 11 × 31 × 41

Divisors: 1, 3, 11, 31, 33, 41, 93, 123, 341, 451

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010001111010111

Octal: 121727

Duodecimal: 20333

Hexadecimal: a3d7

Square: 1759215249

Square Root: 204.79990234372673

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

Maximum cycle length in differentiation digraph for n-bit binary sequences. A38553

a(n) = (2^A002326(n)-1)/(2·n+1). A165781

Lerch's function q₂(n) = (2^φ(t) - 1)/t where t = 2·n - 1. A1226

a(n) = (1/n)*A204983(n). A204984

Let p be the n-th prime and let g be the order of 2 mod p (see A014664). Then if g is even, a(n) = p*(2^g/2 - 1), otherwise a(n) = 2^g - 1. A135546

(1/n)*A204991(n). A204992

a(n) is least k such that k and 7k are anagrams in base n (written in base 10). A23099

a(n) = ∑_k=m..n T(k,n-k), where m = floor((n+1)/2); a(n) is the n-th diagonal-sum of left justified array T given by A027935. A27947

Nearest integer to n⁵/25. A61003

Squarefree part of 2ⁿ-1 : the smallest number such that a(n)*(2ⁿ-1) is a square. A69112