3898
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
- 4
- Divisor Sum
- 5850
- Proper Divisor Sum (Aliquot Sum)
- 1952
- 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
- 1948
- Möbius Function
- 1
- Radical
- 3898
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 144
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Coordination sequence T8 for Zeolite Code EUO.at n=39A008103
- Coordination sequence T4 for Zeolite Code MTW.at n=41A008199
- Number of ordered 5-tuples of integers from [ 1,n ] with no common factors among pairs.at n=25A015663
- T(n,n-2), array T given by A047010.at n=7A047014
- Sum of digits = 7 times number of digits.at n=40A061424
- Values of k for which A065358(k) is 0.at n=43A064940
- Let b(1)=b(2)=1, b(k) = (2^b(k-1)+2^b(k-2)) (mod k); sequence gives values of n such that b(n)=0.at n=26A074782
- Interprimes (A024675) which are of the form s*prime, s=2.at n=29A075277
- Hierarchies of hierarchies.at n=5A075744
- a(n) = floor(T(n+1)!*T(n-1)!/(T(n)!)^2), where T(n) = n(n+1)/2 = the n-th triangular number.at n=31A077539
- a(n) = floor(A093456(n+1)/A093456(n)).at n=36A093455
- Main diagonal of A101858.at n=32A101863
- Number of distinct values of i*j + j*k + k*i with 1 <= i < j <= k <= n.at n=43A102533
- Binomial transform of the Tower of Hanoi sequence.at n=11A106461
- Semiprimes a such that there exist three semiprimes b, c and d with a^3=b^3+c^3+d^3.at n=26A113490
- Positive numbers that are not the sum of a triangular number, a nonnegative cube and a positive Fibonacci number.at n=35A115177
- a(1)=1, a(2)=3, a(3)=8; for n>=4, a(n) = 10*a(n-3) + 8 (if a(n-3) is odd) or + 9 (if a(n-3) is even).at n=10A117713
- Semiprimes which are divisible by their multiplicative digital root.at n=32A118696
- a(n) = Sum_{k=1..n} binomial(n+k-1, n)^2 / n.at n=4A129763
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 1), (0, 1, -1), (1, -1, 1), (1, 0, 1)}.at n=7A149464