3889
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3890
- 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
- 3888
- Möbius Function
- -1
- Radical
- 3889
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 38
- 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
- 539
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/6.at n=27A001136
- Primes of the form 2^q*3^r*5^s + 1.at n=47A002200
- A jumping problem.at n=16A002466
- A variant of the cuban primes: primes p = (x^3 - y^3)/(x - y) where x = y + 2.at n=9A002648
- Class 1- (or Pierpont) primes: primes of the form 2^t*3^u + 1.at n=24A005109
- Coordination sequence T5 for Zeolite Code AET.at n=43A008011
- Coordination sequence T5 for Zeolite Code MTW.at n=41A008200
- Number of partitions of n into parts >= 4.at n=52A008484
- a(0) = 1, a(n) = 23*n^2 + 2 for n>0.at n=13A010013
- 3 and -3 are both 4th powers (one implies other) mod these primes p=1 mod 8.at n=25A014755
- n is equal to the number of 1's in all numbers <= n written in base 6.at n=11A014890
- Numbers k such that the continued fraction for sqrt(k) has period 31.at n=18A020370
- For even n, a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n); for odd n, the least integer such that a(n+2)/a(n+1) > a(n+1)/a(n); a(0) = 4, a(1) = 16.at n=5A022030
- Discriminants of quintic fields with 4 complex conjugates.at n=13A023685
- a(n) = least m such that if r and s in {1/3, 1/6, 1/9,..., 1/3n} satisfy r < s, then r < k/m < s for some integer k.at n=40A024824
- Numbers whose least quadratic nonresidue (A020649) is 11.at n=22A025024
- Number of partitions of n in which the least part is 4.at n=55A026797
- Coordination sequence T3 for Zeolite Code CGS.at n=46A027367
- Sequence satisfies T^2(a)=a, where T is defined below.at n=52A027589
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 7.at n=10A031420