9771
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13032
- Proper Divisor Sum (Aliquot Sum)
- 3261
- 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
- 6512
- Möbius Function
- 1
- Radical
- 9771
- 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
- 135
- 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
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)*Pi*n^(3/2), P(n) = A(n) - V(n); A000092 gives values of n where |P(n)| sets a new record; sequence gives A(A000092(n)).at n=13A000413
- T(2n+1,n+4), T given by A026747.at n=5A026868
- 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 97.at n=35A031595
- a(1) = 3; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=47A033681
- Antidiagonal sums of table A083044.at n=15A083046
- Integers m such that the base-10 digit concatenation 2//m//3//m//5//m...//prime(49)//m//prime(50) is prime.at n=20A084048
- a(n) = sum of absolute values of coefficients of (1+x-x^2)^n.at n=11A084611
- a(n)=a(n-1)+sum of digits(a(n-1))*sum of digits(a(n-2)).at n=37A108720
- Indices where A138554 requires only squares < floor(sqrt(n))^2.at n=35A138555
- Number of nondecreasing strings of numbers x(i=1..n) in -4..4 with sum x(i)^3 equal to 0.at n=21A188272
- Number of (w,x,y,z) with all terms in {1,...,n} and w<x*y*z.at n=10A212057
- Numbers k such that sum of digits of k = sum of digits of anti-divisors of k.at n=9A213239
- Number of length n+5 0..2 arrays with every six consecutive terms having the maximum of some three terms equal to the minimum of the remaining three terms.at n=4A250330
- T(n,k)=Number of length n+5 0..k arrays with every six consecutive terms having the maximum of some three terms equal to the minimum of the remaining three terms.at n=19A250336
- Number of length 5+5 0..n arrays with every six consecutive terms having the maximum of some three terms equal to the minimum of the remaining three terms.at n=1A250341
- a(n) = 12*n^4 + 16*n^3 + 10*n^2 + 4*n + 1.at n=5A272124
- Number of ways to choose disjoint strict rooted partitions of each part in a strict rooted partition of n.at n=30A301756
- a(n) = Sum_{i=1..n} phi(i)*phi(i+1), where phi(n) = A000010(n) is Euler's totient function.at n=43A330319
- Numbers such that the arithmetic mean of its digits is equal to twice the population standard deviation of its digits.at n=35A371463