4863
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6488
- Proper Divisor Sum (Aliquot Sum)
- 1625
- 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
- 3240
- Möbius Function
- 1
- Radical
- 4863
- 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
- 90
- 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
- Number of atoms in a decahedron with n shells.at n=18A004068
- Expansion of tan(log(1+x))*cos(x).at n=7A009642
- [ (4th elementary symmetric function of S(n))/(2nd elementary symmetric function of S(n)) ], where S(n) = {first n+3 positive integers congruent to 1 mod 4}.at n=9A024389
- Numbers having period-2 6-digitized sequences.at n=11A031357
- 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 46.at n=22A031544
- Becomes prime after n iterations of f(x) = sigma(x)-1 (least inverse of A039655).at n=14A039656
- Whitney number of level n of the lattice of the ideals of the crown of size 2 n.at n=11A051292
- Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the 4th power of the number of divisors of k.at n=21A055468
- a(n) = T(n,n-4), array T as in A055801.at n=36A055804
- C(n+3)=2*C(n), where C(n) is Cototient(n) := n - phi(n) (A051953).at n=30A063480
- Sum of the areas of the first n Jacobsthal rectangles.at n=7A096978
- Expansion of (1+2*x+4*x^2+8*x^3+16*x^4)/(1-x-32*x^6).at n=12A098583
- a(n) = (5*n^2 + n + 2)/2.at n=44A116668
- Numbers ending in 1, 3, 7 or 9 such that either prepending or following them by one digit doesn't produce a prime.at n=23A124666
- A transformation of the Catalan sequence.at n=17A129110
- Triangle read by rows: T(n,k) = C(n) + C(k) - 1 where C(n) = A000108(n) are the Catalan numbers, 0 <= k <= n.at n=47A131429
- a(n) = C(n) + 1 - 0^n where C(n) = A000108(n).at n=9A141351
- A sequence of asymptotic density zeta(9) - 1, where zeta is the Riemann zeta function.at n=9A143035
- 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, -1, 0), (-1, 1, -1), (0, 0, 1), (1, 0, -1), (1, 0, 1)}.at n=7A150304
- T(n,k) = A009766(n,k) + A009766(n,n-k), triangle read by rows.at n=45A156197