8773
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9088
- Proper Divisor Sum (Aliquot Sum)
- 315
- 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
- 8460
- Möbius Function
- 1
- Radical
- 8773
- 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
- Decimal concatenation of n-th lucky number and n-th prime number.at n=20A032604
- Numbers k such that k | 10^k + 9^k + 8^k + 7^k.at n=22A057214
- Composite numbers such that all divisors >1 have the same number of 1's in binary representation.at n=25A089042
- a(n) = A113290(n,1)/(n+1) for n>=0, where A113290 is the matrix log of triangle A113287.at n=15A113291
- Row sums of triangle A132870.at n=4A132871
- a(n) = n^3 - 3*(n+3)^2.at n=22A153260
- Numbers k such that the number of digits d in k^2 is not prime and for each factor f of d the sum of the d/f digit groupings in k^2 of size f is a square.at n=27A153745
- Numbers k such that there are 8 digits in k^2 and for each factor f of 8 (1,2,4) the sum of digit groupings of size f is a square.at n=17A153746
- Numbers n whose square can be represented as a repdigit number in some base less than n.at n=38A158235
- Primitive numbers in A158235.at n=18A158245
- Monotonic ordering of set S generated by these rules: if x and y are in S then (x+1)(y+1) is in S, and 2 is in S.at n=33A192518
- Number of (n+1)X(n+1) -11..11 symmetric matrices with every 2X2 subblock having sum zero and one, two or three distinct values.at n=4A211714
- Number of (w,x,y,z) with all terms in {1,...,n} and w*x+y*z>n^2.at n=17A212136
- Numbers n such that Q(sqrt(n)) has class number 7.at n=27A218039
- Fundamental discriminants of real quadratic number fields with class number 7.at n=14A218157
- Odd composite numbers n, such that n, n+d, n*d and n/d are all odious (A000069) for every divisor d of n.at n=19A231558
- a(n) = Sum_{i=0..n} digsum_9(i)^4, where digsum_9(i) = A053830(i).at n=9A231687
- Array read by antidiagonals: T(n,k) = number of lattice paths from (0,0) to (n,k) using steps (1,0), (0,1), (1,1), (-1,1) and whose points lie entirely in the integer rectangle of lattice points {(i, j): 0 <= i <= n, 0 <= j <= k}.at n=41A232968
- Number of n X 5 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=3A239597
- T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=31A239599