4857
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6480
- Proper Divisor Sum (Aliquot Sum)
- 1623
- 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
- 3236
- Möbius Function
- 1
- Radical
- 4857
- 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
- 165
- 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 bipartite partitions.at n=14A002762
- a(n) = Sum_{k|n} mu(k)*Catalan(n/k) (mu = Moebius function A008683).at n=8A002996
- a(n) = floor(1000*log_2(n)).at n=28A004265
- 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=21A031544
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 4).at n=43A035549
- All differences C(j)-C(i), j>i, of Catalan numbers A000108.at n=34A047075
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=40A050061
- Numbers n such that the trajectory of n under the "3x+1" map reaches n+1.at n=35A070993
- Number of permutations that avoid the generalized pattern 1234-5.at n=7A071077
- G.f. is 1/F, where x*F is g.f. for Fibonacci word (A003849).at n=66A080845
- Records in A104883.at n=17A104884
- Trajectory of 10 under map k -> A111273(k).at n=17A113702
- Binomial transform of A001113.at n=10A126082
- 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, 1), (-1, 0, 0), (0, 1, -1), (1, 0, -1), (1, 1, 1)}.at n=7A149686
- Bisect A053445 then calculate the first differences of the resulting sequence.at n=29A160643
- a(n) = (2*n^3 + 9*n^2 + n + 24) / 6.at n=23A160805
- Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^4 = I.at n=14A162920
- a(n) = A053445(n-2) - A053445(n-4).at n=55A162932
- Partial sums of A050705.at n=36A177791
- Index of first occurrence of 2n in A031883, or 0 if 2n never occurs in A031883 = first differences of lucky numbers A000959.at n=29A181558