4853
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5088
- Proper Divisor Sum (Aliquot Sum)
- 235
- 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
- 4620
- Möbius Function
- 1
- Radical
- 4853
- 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
- 46
- 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
- no
- Odd
- yes
Appears in sequences
- Positions of remoteness 3 in Beans-Don't-Talk.at n=31A005695
- Coordination sequence T4 for Zeolite Code MOR.at n=45A008185
- a(0) = 1, a(n) = 11*n^2 + 2 for n>0.at n=21A010003
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/9).at n=16A011919
- Expansion of Product_{m>=1} (1+m*q^m)^-23.at n=4A022715
- Coordination sequence T2 for Zeolite Code SFF.at n=46A038438
- Number of partitions satisfying cn(0,5) = cn(2,5) + cn(3,5).at n=42A039859
- Base-7 palindromes that start with 2.at n=17A043016
- a(0)=1; a(1)=1; a(n)= a(n-1) + floor( sqrt(a(n-1)*a(n-2))+ sqrt(a(n-3)*a(n-4))+ ... ).at n=14A043327
- a(n)=a(n-1)+a(n-2)-d, where d=a(n/4) if 4 divides n, else d=0; 2 initial terms.at n=19A050194
- Smallest m such that A051145(m) = 2^n.at n=19A051147
- a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1.5, p=2.at n=42A053522
- Number of nonnegative integer 2 X 2 matrices with no zero rows or columns and with sum of elements equal to n, up to row and column permutation.at n=45A054974
- Number of 3-element antichains on an unlabeled n-element set; equivalence classes of monotone Boolean functions of n variables with 3 mincuts under action of symmetric group S_n.at n=12A056778
- Triangle of coefficients of certain numerator polynomials N(n,x).at n=37A064307
- Let f(x) = phi(x) + sigma(x); a(n) = least k such that at k begins a maximal run of length n of consecutive strict local extrema of f, or 0 if no such k exists.at n=20A066923
- Composite numbers k such that the continued fraction for k/m contains no 2 for any 1 <= m <= k.at n=12A082409
- a(n) = sum of the first n upper twin primes.at n=24A086168
- a(n) = round(n^3/12) - floor(n/4)*floor((n+2)/4).at n=39A090676
- Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row.at n=20A095182