Properties of the Number 47641

Forty-Seven Thousand Six Hundred Forty-One

Basics

Value: 47640 → 47641 → 47642

Parity: odd

Prime: No

Previous Prime: 47639

Next Prime: 47653

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 61 × 71

Divisors: 1, 11, 61, 71, 671, 781, 4331, 47641

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101000011001

Octal: 135031

Duodecimal: 236A1

Hexadecimal: ba19

Square: 2269664881

Square Root: 218.26818366404206

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

Euler pseudoprimes to base 5: composite integers such that abs(5^{(n - 1}/2)) == 1 mod n. A262052

The Wiener index of a benzenoid consisting of a linear chain of n hexagons. A143938

Base-5 Euler-Jacobi pseudoprimes: odd composite k coprime to 5 such that 5^(k-1/2) == (5/k) (mod n), where (5/k) is the Jacobi symbol (or Kronecker symbol). A375914

Composite numbers k == 1, 9 (mod 10) such that 5^(k-1/2) == 1 (mod k). A375915

Square array A(n,k), n >= 1, k >= 1, read by antidiagonals downwards, where A(n,k) = n! * k! * [xⁿ * y^k] (1/3) * (1 / (exp(x) + exp(y) - exp(x+y))³ - 1). A382741

a(n) = a(n-1) + 2·n² with a(1) = 1. A112524

Strong pseudoprimes to base 25. A20251

Strong pseudoprimes to base 46. A20272

Sum of distinct residues of all factorials mod 2ⁿ. A210337

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 705", based on the 5-celled von Neumann neighborhood. A273419