4893
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7488
- Proper Divisor Sum (Aliquot Sum)
- 2595
- 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
- 2784
- Möbius Function
- -1
- Radical
- 4893
- 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
- 134
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 7 positive 6th powers.at n=43A003363
- Coordination sequence T1 for Zeolite Code AFO.at n=46A008015
- Fibonacci sequence beginning 0, 21.at n=13A022355
- Sequence satisfies T(a)=a, where T is defined below.at n=47A027592
- Smaller of a pair of consecutive lucky numbers with a gap of 2n.at n=17A031884
- Numbers having three 6's in base 9.at n=15A043479
- Recip transform of 2*(1 + x^2)-1/(1-x).at n=10A049150
- Numbers k such that 37*2^k-1 is prime.at n=2A050544
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 4.at n=44A051969
- Number of ternary Lyndon words of length n with trace 0 and subtrace 1 over GF(3).at n=11A053560
- Number of ternary Lyndon words of length n with trace 0 and subtrace 2 over GF(3).at n=11A053561
- a(n) = F(3)*F(n)*F(n+1) + F(4)*F(n+1)^2 - F(4) if n even, F(3)*F(n)*F(n+1) + F(4)*F(n+1)^2 if n odd, where F(n) is the n-th Fibonacci number (A000045).at n=8A080143
- Square array of numbers T(n,k) = ((1+sqrt(3))*(k+sqrt(3))^n-(1-sqrt(3))*(k-sqrt(3))^n)/(2*sqrt(3)), read by antidiagonals.at n=50A086404
- Triangle read by rows: binary products of Fibonacci numbers.at n=48A094565
- A card-arranging problem: values of n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a fifth power for every i.at n=18A096906
- Start with 1 and repeatedly reverse the digits and add 46 to get the next term.at n=50A118091
- Smaller of two consecutive lucky numbers with the same digital sum.at n=16A118566
- Triangle given by T(n,k) = Fibonacci(n+k+1)*binomial(n,k) for 0<=k<=n.at n=33A122070
- Number of integers k>=n such that binomial(k,n) has fewer than n distinct prime factors.at n=45A129233
- Row sums of triangle A131424.at n=29A131425