9936
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 29760
- Proper Divisor Sum (Aliquot Sum)
- 19824
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3168
- Möbius Function
- 0
- Radical
- 138
- Omega Function (Ω)
- 8
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 91
- 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
- Restricted permutations.at n=14A000496
- a(n) = 10^n - n^3.at n=4A024117
- Expansion of (1-2x)/(1-2x-2x^2+2x^3).at n=12A052970
- Number of staircase polygons of area n with 2 (staircase polygon) holes on square lattice (not allowing rotations).at n=6A057415
- Numbers k such that sigma(x) = k has exactly 7 solutions.at n=40A060663
- Number of cubes of primes <= 2^n.at n=50A060969
- f-amicable numbers where f(n) = n+1.at n=4A066505
- Numbers k such that gcd(d(k^3), d(k)) is not a power of 2.at n=28A069781
- Omega(n) = Omega(n-1)^3, where Omega(m) (A001222) denotes the number of prime factors of m, counting multiplicity.at n=41A076155
- Numbers k such that sopfr(k)=tau(k).at n=20A078511
- a(n) = 6^n*(n^2 - n + 72)/72.at n=5A081912
- Number of triangular partitions of n of order 4.at n=16A084446
- Enneagorials: n-th polygorial for k=9.at n=4A084942
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 69.at n=3A093269
- Primitive elements of A096490.at n=11A118671
- Triangular array read by rows: T(n,1) = T(n,n) = 1, T(n,k) = 4*T(n-1, k-1) + 2*T(n-1, k).at n=31A119726
- a(n) = 2 + floor((1 + Sum_{j=1..n-1} a(j))/5).at n=47A120171
- Expansion of Sum_{k>=0} x^(k^2+k)/((1-x)(1-x^2)...(1-x^(2k))).at n=53A122134
- a(n) = Product_{k>=0} (1 + floor(n/2^k)).at n=22A132269
- Expansion of 1/(1 + x - x^2 - 3*x^3 - x^4 + x^5 + x^6).at n=37A147592