8835
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
- 16
- Divisor Sum
- 15360
- Proper Divisor Sum (Aliquot Sum)
- 6525
- 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
- 4320
- Möbius Function
- 1
- Radical
- 8835
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 96
- 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
- a(n) = (4*n+1)*(4*n+3).at n=23A001539
- Multilevel sieve: at k-th step, accept k numbers, reject k, accept k, ...at n=10A005209
- Quadrinomial coefficients: C(2+n,n) + C(3+n,n) + C(4+n,n).at n=18A005718
- a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026681.at n=12A026689
- Number of noncrossing bushes with n nodes; i.e., rooted noncrossing trees with n nodes and no nonroot nodes of degree 1.at n=8A030981
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=16A031947
- Numbers whose set of base-14 digits is {1,3}.at n=26A032921
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=16A049357
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 7 skipped primes.at n=43A050774
- Numbers k such that sigma(k^2-k-1) = k*(k+1).at n=21A069826
- Numbers k such that k!! + 2^4 is prime.at n=20A076189
- Starting with a(0) = 1, smallest squarefree number k such that, for all a(m), m < n, k + a(m) is not squarefree.at n=11A077225
- Starting with a(0)=5, a(n) = smallest squarefree number k such that, for all a(m) with m<n, k+a(m) is not squarefree.at n=13A080797
- Numbers k that have no zero digits and such that both k+1 and (product of digits of k) + 1 are squares.at n=12A081990
- a(n) is the minimal area of a convex lattice polygon with 2n sides.at n=38A089187
- Largest n-digit number k such that k+1 as well as 1 + the product of digits of k are squares greater than 1.at n=3A089698
- Numbers belonging to both A077225 and A080797 (in the order in which they appear in A077225).at n=6A090627
- Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k nonroot nodes of degree 1.at n=36A101449
- Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k branches.at n=44A101452
- a(n) = (3+n)*(2 + 33*n + n^2)/6.at n=28A101860