Properties of the Number 3922

Three Thousand Nine Hundred Twenty-Two

Basics

Value: 3921 → 3922 → 3923

Parity: even

Prime: No

Previous Prime: 3919

Next Prime: 3923

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 37 × 53

Divisors: 1, 2, 37, 53, 74, 106, 1961, 3922

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111101010010

Octal: 7522

Duodecimal: 232A

Hexadecimal: f52

Square: 15382084

Square Root: 62.625873247404705

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

a(0) = 1, a(n) = 5·n² + 2 for n>0. A10001

Compound filter (prime signature & sum of the divisors): a(n) = P(A046523(n), A000203(n)), where P(n,k) is sequence A000027 used as a pairing function. A286360

Positive integers n such that n¹³ + 1 is semiprime. A105237

Numbers k > 1 such that, in base 3, k and k² contain the same digits in the same proportion. A61657

Positions of 18 after decimal point in decimal expansion of π. A134218

Total number of positive integers below 10ⁿ requiring 6 positive cubes in their representation as sum of cubes. A181400

T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..1 nXk array. A220406

a(n) = lcm(A051612(n), A065387(n)), where A051612(n) = σ(n) - φ(n) and A065387(n) = σ(n) + φ(n). A77100

Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 37, the first irregular prime. A92230

Numbers n such that primorial(n)/2 + 32 is prime. A139445