Properties of the Number 72041

Seventy-Two Thousand Forty-One

Basics

Value: 72040 → 72041 → 72042

Parity: odd

Prime: No

Previous Prime: 72031

Next Prime: 72043

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 61 × 1181

Divisors: 1, 61, 1181, 72041

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001100101101001

Octal: 214551

Duodecimal: 35835

Hexadecimal: 11969

Square: 5189905681

Square Root: 268.40454541605664

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 3: composite integers such that abs(3^{(n - 1}/2)) == 1 mod n. A262051

Odd numbers k > 1 such that gcd(3,k) = 1 and 3^(k-1/2) == -(3/k) (mod k), where (3/k) is the Jacobi symbol (or Kronecker symbol); Euler pseudoprimes to base 3 (A262051) that are not Euler-Jacobi pseudoprimes to base 3 (A048950). A375490

Super pseudoprimes (or superpseudoprimes) to base 3: Fermat pseudoprimes to base 3 all of whose divisors that are larger than 1 are either primes or Fermat pseudoprimes to base 3. A328662

a(n) = 1 + 4·n*(1 + 2·n²)/3. A171272

Numbers k > 2 such that 3^k-1 == 1 (mod k) and gcd(k, 2^k-1-1) = 1. A306144

a(n) is the smallest number of the form k + reverse(k) for exactly n integers k, or -1 if no such number exists. A72041

Numbers k such that gcd(k, 2^k - 2) = 1 and gcd(k, 3^k - 3) > 1. A318055