8852
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
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15498
- Proper Divisor Sum (Aliquot Sum)
- 6646
- 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
- 4424
- Möbius Function
- 0
- Radical
- 4426
- Omega Function (Ω)
- 3
- 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
- no
- Squarefree Number
- no
- 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 two-rowed partitions of length 3.at n=36A001993
- a(n) is nonsquarefree and is sum of first k nonsquarefrees for some k.at n=37A013935
- Expansion of 1/(1-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13).at n=48A017853
- Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code.at n=28A030504
- Becomes prime or 4 after exactly 8 iterations of f(x) = sum of prime factors of x.at n=31A048130
- a(n) is smallest positive integer, distinct from any terms earlier in the sequence, such that (sum{k=1 to n}[a(k)]) divides (product{k=1 to n}[a(k)])*(sum{k=1 to n}[1/a(k)]).at n=12A058330
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 83 ).at n=31A063356
- Main diagonal of array A082224.at n=47A082227
- Let m = number of ways of partitioning n into parts using all the parts of a subset of {1, 2, ..., n-1} whose sum of all parts of a subset is less than n; a(n) gives number of different subsets of {1, 2, ..., n-1} whose m is 0.at n=52A088528
- Values of k such that floor(k*tanh(Pi)) = floor((k+1) tanh(Pi)).at n=32A096613
- Number of partitions of n with rank 3 (the rank of a partition is the largest part minus the number of parts).at n=49A101200
- a(n) = (2^(semiprime(n)-1)) modulo (semiprime(n)^2).at n=37A115948
- Number of 6X6 arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to n.at n=33A156389
- Number of n X n arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to 33.at n=3A156494
- Number of groups of order prime(n)^6.at n=14A232106
- a(n) = 3*p^2+39*p+344+24*gcd(p-1,3)+11*gcd(p-1,4)+2*gcd(p-1,5), where p = prime(n).at n=14A269749
- Number of decompositions of n as a sum of nonnegative multiples of 5, 7, even numbers greater than 2, and the two partitions obtained by expressing the numbers 6 and 8 (each of them exactly once) as a sum using positive integers less than 4.at n=59A278575
- Numbers k such that (14*10^k - 71) / 3 is prime.at n=22A279467
- Triangle T(n,k), n>=1, 0 <= k <= A002620(n-1), read by rows, where T(n,k) is the number of self-avoiding paths of length 2*(n+k) along the edges of a grid with n X n square cells, which do not pass above the diagonal, start at the lower left corner and finish at the upper right corner.at n=27A340043
- Numbers that are the sum of eight fourth powers in exactly five ways.at n=42A345837