9558
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
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 21780
- Proper Divisor Sum (Aliquot Sum)
- 12222
- 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
- 3132
- Möbius Function
- 0
- Radical
- 354
- Omega Function (Ω)
- 6
- 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
- 78
- 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
- Percolation series for directed square lattice.at n=22A006462
- Pisot sequence E(14,23), a(n) = floor( a(n-1)^2/a(n-2)+1/2 ).at n=13A010902
- 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 96.at n=19A031594
- Numbers k such that A102489(k) is divisible by k.at n=35A032563
- Numerators of continued fraction convergents to sqrt(844).at n=4A042628
- Numbers whose base-2 representation has exactly 12 runs.at n=19A043579
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 6 skipped primes.at n=43A050773
- Numbers k such that gcd(k, reverse(k)) = 27 = 3^3, where reverse(x) = A004086(x).at n=41A072016
- a(n) = a(n-2) * a(n-3) + a(n-3), n>3. a(1) = a(2) = a(3) = 1.at n=12A079069
- Expansion of (1-4x+6x^2-3x^3)/(1-5x+9x^2-8x^3+4x^4).at n=12A093041
- Least k such that k*M#(n) + 1 is prime where M#(n) is the product of the first n Mersenne primes = Product_{j=1..n} A000668(j).at n=17A098920
- Numbers n such that z(n) and z(n+1) are both prime, where z(n) = a^d + b^d + c^d + ..., where a*b*c* ... is the prime factorization of n and d is the largest digit of n.at n=11A109280
- a(n) = 13 + floor(Sum_{j=1..n-1} a(j)/3).at n=23A120157
- a(n) = a(n-1) + 4*a(n-2) - 4*a(n-3) for n > 2; a(0)=2, a(1)=3, a(2)=6.at n=13A137208
- Convolution of A008619 and A001400.at n=29A139672
- Nonprimes in the triangle A141020.at n=24A141031
- 3 times heptagonal numbers: a(n) = 3*n*(5*n-3)/2.at n=36A152773
- 3 times 11-gonal (or hendecagonal) numbers: a(n) = 3*n*(9*n-7)/2.at n=27A153783
- a(n) = a(n-1) + 2*a(n-2) with a(0)=3, a(1)=4.at n=12A171160
- a(1)=1, then a(n) = smallest number whose square is larger than 2*(a(n-1))^2.at n=24A175539