3923
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3924
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3922
- Möbius Function
- -1
- Radical
- 3923
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 175
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 544
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of form n^2 + n + 17.at n=43A007635
- Coordination sequence T2 for Zeolite Code -CHI.at n=40A009847
- Coordination sequence T5 for Zeolite Code TER.at n=42A016437
- Primes that remain prime through 2 iterations of function f(x) = 3x + 8.at n=39A023248
- Primes that remain prime through 2 iterations of function f(x) = 8x + 3.at n=37A023261
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = sum of numbers in row n+1 of the array T defined in A026105. Also a(n) = T(n,n), where T is the array defined in A025564.at n=10A025566
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 61.at n=18A031559
- Number of primes less than 1000n.at n=36A038812
- Discriminants of imaginary quadratic fields with class number 23 (negated).at n=13A046020
- Third member of a sexy prime quadruple: value of p+12 such that p, p+6, p+12 and p+18 are all prime.at n=15A046123
- Primes p such that p+6 and p+8 are also primes.at n=31A046138
- p, p+6 and p+8 are all primes (A046138) but p+2 is not.at n=21A049438
- Numbers k such that 181*2^k-1 is prime.at n=30A050842
- Primes p such that x^37 = 2 has no solution mod p.at n=14A059223
- Primes p such that x^53 = 2 has no solution mod p.at n=8A059258
- Primes q such that 6*q-1 and 6*q+1 are twin primes. Proper subset of A002822.at n=47A060212
- a(1) = 1; a(n) = sum of terms in the continued fraction for the square of the continued fraction [a(1); a(2), a(3), a(4),..., a(n-1)].at n=30A061143
- Square array read by antidiagonals: number of ways a pawn-like piece (with the initial 2-step move forbidden and starting from any square on the back rank) can end at various squares on an infinite chessboard.at n=53A062105
- Primes starting and ending with 3.at n=31A062333
- Lonely non-twin primes: non-twins sandwiched between two pairs of twins.at n=22A068016