4854
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9720
- Proper Divisor Sum (Aliquot Sum)
- 4866
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1616
- Möbius Function
- -1
- Radical
- 4854
- 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
- 121
- 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
- Positions of remoteness 3 in Beans-Don't-Talk.at n=32A005695
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=63A013583
- Numbers k such that Fibonacci(k) == 8 (mod k).at n=37A023177
- 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 68.at n=18A031566
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5)).at n=46A036814
- a(1) = 1, a(m+1) = 2*Sum_{k=1..floor((m+1)/2)} a(k).at n=48A039722
- a(1) = 1, a(m+1) = 2*Sum_{k=1..floor((m+1)/2)} a(k).at n=47A039722
- Numbers congruent to 2,3,6,11 mod 12 missing from A042944 (conjectured to be finite).at n=25A042945
- a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 1,1,4.at n=14A049867
- Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879.at n=23A063052
- Sum of terms of n-th row of A077664.at n=41A077666
- In binary representation: numbers not occurring in their factorial.at n=33A093685
- Initial values for iteration of the function f(x) = A063919(x) such that the iteration ends in a 14-cycle, i.e., in A097030.at n=38A097034
- Expansion of 3*x^2*(2*x^2+9*x-2)/((3*x^2-5*x+1)*(3*x^2+5*x-1)).at n=5A106850
- A000799(n) - A064355(n).at n=53A114699
- Inverse Moebius transform operation performed 24 times on A000594: A051731^24 * A000594.at n=4A128382
- Sums of three consecutive pentagonal numbers.at n=32A129863
- Fourth differences of A129983.at n=11A129988
- Values of m such that A139361(n)=4m+1.at n=15A139362
- Total number of single toothpicks after n-th stage in the Y-toothpick structure of A160120.at n=50A160167