3879
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 5616
- Proper Divisor Sum (Aliquot Sum)
- 1737
- 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
- 2580
- Möbius Function
- 0
- Radical
- 1293
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 144
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence T3 for Zeolite Code AFO.at n=41A008017
- Coordination sequence T4 for Zeolite Code MEL.at n=40A008153
- Coordination sequence T1 for Zeolite Code RUT.at n=41A009897
- n is equal to the number of 2's in all numbers <= n written in base 6.at n=1A014891
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=32A023180
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 5).at n=53A035572
- Base-8 palindromes that start with 7.at n=14A043027
- Coordination sequence T6 for Zeolite Code SFE.at n=41A057322
- Numbers of form 2^i*3^j - (i+j) with i, j >= 0.at n=52A069355
- a(n) is the smallest number k such that A073813(k) = prime(n).at n=18A073814
- Least k such that Sum_{i=1..k} 1/phi(i) >= n.at n=15A074467
- Interprimes which are of the form s*prime, s=9.at n=12A075284
- Let m = number of ways of partitioning n into parts using all the parts of a subset of {1, 2, ..., n-1} whose sum of all parts of a subset is less than n; a(n) gives number of different subsets of {1, 2, ..., n-1} whose m is 0.at n=45A088528
- Numbers k such that numerator of Bernoulli(2k) is divisible by the square of 59, the second irregular prime.at n=5A093058
- Indices of primes in sequence defined by A(0) = 97, A(n) = 10*A(n-1) - 3 for n > 0.at n=14A101013
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 10 multiples of n-1, n-2, ..., 1, for n>=1.at n=28A113747
- Nonprime terms of A115558.at n=40A115559
- a(n) is such that the a(n)-th composite number is (n-th prime)^2.at n=18A120389
- Indices of pentagonal numbers > 0 which are not the difference of 2 other pentagonal numbers > 0.at n=49A135768
- Numbers x such that for some y < sqrt(2x), x^2 + x + y^2 is an odd primitive abundant number, A136476(n).at n=42A136477