8359
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9016
- Proper Divisor Sum (Aliquot Sum)
- 657
- 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
- 7704
- Möbius Function
- 1
- Radical
- 8359
- 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
- 140
- 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 partitions of floor(5n/2)-1 into n nonnegative integers each no more than 5.at n=33A001976
- Number of 2n-bead black-white reversible complementable necklaces with n black beads.at n=11A006840
- Numbers k such that the continued fraction for sqrt(k) has period 80.at n=27A020419
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A014306.at n=36A024467
- Number of partitions of n into an odd number of parts, the least being 4; also, a(n+4) = number of partitions of n into an even number of parts, each >=4.at n=66A027190
- Sum of a(n) terms of 1/k^(6/7) first exceeds n.at n=19A056183
- Integers n > 1997 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 1997.at n=8A063055
- Integers y such that 11*x^2 - 9*y^2 = 2 for some integer x.at n=3A083043
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=41A098936
- Sum of first n Mersenne primes A000668.at n=4A153474
- Expansion of (1+x+x^2) / ((1-x)*(1-x-x^2)).at n=16A154691
- Totally multiplicative sequence with a(p) = a(p-1) + 6 for prime p.at n=38A166703
- Monotonic ordering of set S generated by these rules: if x and y are in S then 5xy-x-y is in S, and 1 is in S.at n=30A192528
- Number of (w,x,y) with all terms in {0,...,n} and 2*max(w,x,y) >= 3*min(w,x,y).at n=20A213392
- Number of distinct values of the sum of a*b+a*c+b*c over 2 sets of three a,b,c 0..n integers.at n=38A225269
- Smallest number m such that the n-th prime is the median prime factor of 1..m, cf. A212300.at n=39A246430
- Triangle read by rows: Poincaré polynomials of orbifold of Fermat hypersurfaces.at n=17A281620
- a(n) = PrimePi(n^3) - PrimePi(n)^3, where PrimePi = A000720.at n=49A291538
- Coordination sequence for "ubt" 3D uniform tiling.at n=47A299291
- Number of compositions of n into parts with distinct multiplicities and with exactly six parts.at n=42A321776