4788
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
- 4
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 14560
- Proper Divisor Sum (Aliquot Sum)
- 9772
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1296
- Möbius Function
- 0
- Radical
- 798
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 121
- Smith Number
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- One half of the number of permutations of [n] such that the differences have 4 runs with the same signs.at n=3A000486
- a(n) is the number of integers m which take n steps to reach 1 in '3x+1' problem.at n=38A005186
- Number of rooted planar maps with 4 faces and n vertices and no isthmuses.at n=6A006468
- Primitive repfigit numbers.at n=11A006576
- Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers).at n=13A007629
- Triangle T(n,k) = P(n,k)/2, n >= 2, 1 <= k < n, of one-half of number of permutations of 1..n such that the differences have k runs with the same signs.at n=24A008970
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/30).at n=21A011940
- a(n) = Sum_{i,j,k in Z and i^2 + j^2 + k^2 <= n} i^2 + j^2 + k^2.at n=20A014203
- Poincaré series [or Poincare series] (or Molien series) for mod 2 cohomology of universal W-group W(3).at n=13A014696
- Number of lines through exactly 6 points of an n X n grid of points.at n=41A018813
- Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (3,k)-perfect numbers.at n=13A019292
- Numbers whose base-5 representation is the juxtaposition of two identical strings.at n=37A020333
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=25A024599
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=24A025113
- dot product (n,n-1,...2,1).(3,4,...,n,1,2).at n=25A026054
- a(n) = n^3 + (n+1)^3 + (n+2)^3 + (n+3)^3.at n=9A027603
- Expansion of 1/((1-3x)(1-4x)(1-8x)(1-9x)).at n=3A028043
- Every run of digits of n in base 13 has length 2.at n=27A033011
- Least Smith number having digital sum A033662(n).at n=14A033663
- Theta series of A2[hole]^4.at n=23A033690