Properties of the Number 41555

Forty-One Thousand Five Hundred Fifty-Five

Basics

Value: 41554 → 41555 → 41556

Parity: odd

Prime: No

Previous Prime: 41549

Next Prime: 41579

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 8311

Divisors: 1, 5, 8311, 41555

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010001001010011

Octal: 121123

Duodecimal: 2006B

Hexadecimal: a253

Square: 1726818025

Square Root: 203.85043536867906

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

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) + 1, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A295953

Number of runs in all Fibonacci binary words of length n. A Fibonacci binary word is a binary word having no 00 subword. A run is a maximal sequence of consecutive identical letters. A129715

Successive approximations up to 2ⁿ for the 2-adic integer 17^1/4. This is the 3 (mod 4) case. A341752

Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 5. A296812

Denominators of continued fraction convergents to sqrt(295). A41555

a(n) is the number of ordered solutions (x,y,z) to x² + y² == z² mod n with 1 <= x,y,z <= n-1. A136679