4478
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6720
- Proper Divisor Sum (Aliquot Sum)
- 2242
- 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
- 2238
- Möbius Function
- 1
- Radical
- 4478
- 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
- 139
- 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
- yes
- Odd
- no
Appears in sequences
- Number of fullerenes with 2n vertices (or carbon atoms).at n=23A007894
- Let c(k) denote the k-th composite number and p(k) the k-th prime number; then a(n) = Sum_{i=n*(n-1)/2+1 .. n*(n+1)/2} c(i) - Sum_{i=1..n} p(i).at n=19A024850
- a(n) = floor(Sum_{1<=i<j<=n} (sqrt(j)-sqrt(i))^2).at n=42A025196
- a(n) = (d(n)-r(n))/5, where d = A026043 and r is the periodic sequence with fundamental period (0,2,3,0,0).at n=37A026045
- a(n) = Sum_{k=0..n} (k+1) * A026758(n, k).at n=9A027235
- Number of distinct products ijk with 0 <= i,j,k <= n.at n=41A027426
- 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 66.at n=10A031564
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 4).at n=39A035548
- a(n)=T(n,n+3), array T as in A049723.at n=36A049731
- Sum of a(n) terms of 1/k^(2/3) first exceeds n.at n=47A056178
- Xcatalans - produced as a self-convolved sequence like Catalan numbers (A000108) but use carryless GF(2)[ X ] polynomial multiplication.at n=9A061922
- Numbers k such that the simple continued fraction for (1+1/k)^k contains k.at n=43A071527
- Numbers n such that |real(zeta(1/2 + n*I))| exceeds all previous values, where zeta is the Riemann zeta function.at n=17A079630
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082345/A082346.at n=11A089406
- a(n) = floor( e^((n/2)*arccosh(1+sqrt(2))) ).at n=11A093698
- Location of records in denominators of Kepler's tree of harmonic fractions.at n=53A095726
- Erroneous version of A007894.at n=16A122661
- a(n) = (n^4 + 2n^3 + 5n^2 + 4)/4.at n=11A123350
- Number of different values of i^2+j^2+k^2+l^2+m^2 for i,j,k,l,m in [0,n].at n=32A132432
- 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, 0, 0), (-1, 1, -1), (0, 1, 1), (1, -1, 0)}.at n=9A148344