3914
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6240
- Proper Divisor Sum (Aliquot Sum)
- 2326
- 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
- 1836
- Möbius Function
- -1
- Radical
- 3914
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 51
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of n-bead necklaces (turning over is allowed) where complements are equivalent.at n=18A000011
- Number of even sequences with period 2n (bisection of A000011).at n=9A000117
- a(n) = C(n,5) + C(n,4) - C(n,3) + 1, n >= 7.at n=9A005288
- Dodecahedral surface numbers: a(0)=0, a(1)=1, a(2)=20, thereafter 2*((3*n-7)^2 + 21).at n=17A007589
- Numbers k such that the continued fraction for sqrt(k) has period 40.at n=29A020379
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (odd natural numbers).at n=16A024473
- Numbers whose set of base-12 digits is {2,3}.at n=18A032812
- Decimal part of a(n)^(1/7) starts with n so that a(n) < a(n+1).at n=26A034072
- Composite numbers whose 3 prime factors are distinct in length.at n=36A046443
- Triangular array generated by its row sums: T(n,0) = 1 for n >= 0, T(n,1) = r(n-1), T(n,k) = T(n,k-1) - (-1)^k * r(n-k) for k = 2, 3, ..., n, n >= 2, r(h) = sum of the numbers in row h of T.at n=37A054090
- Row sums of A054090.at n=7A054091
- Even numbers k such that k/2 is nonprime and sigma(k+1) > sigma(k).at n=41A067827
- Sum_{k=1..n} floor(n*(n-1)/(2*k)).at n=43A069627
- Numbers n such that A007306(n) divides n.at n=41A091765
- First column and main diagonal of triangle A092683, in which the convolution of each row with {1,1} produces a triangle that, when flattened, equals the flattened form of A092683.at n=14A092684
- Triangle T(n,k), read by rows, formed by setting all entries in the zeroth column ((n,0) entries) and the main diagonal ((n,n) entries) to powers of 2 with all other entries formed by the recursion T(n,k) = T(n-1,k) + T(n,k-1).at n=48A096466
- Numbers n such that omega(n-2) = omega(n-1) = omega(n) = omega(n+1) = omega(n+2).at n=41A101294
- Numbers n such that 9*10^n + 7*R_n - 6 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=9A103105
- Intersection of A108027, A108028, A108029 and A108030.at n=3A108109
- Imaginary part of the smallest Gaussian prime having a gap size of exactly A128106(n).at n=14A128108