9288
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
- 32
- Divisor Sum
- 26400
- Proper Divisor Sum (Aliquot Sum)
- 17112
- 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
- 3024
- Möbius Function
- 0
- Radical
- 258
- Omega Function (Ω)
- 7
- 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
- 184
- 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
- Trails of length n on honeycomb lattice.at n=13A006851
- a(n) is nonsquarefree and is sum of first k nonsquarefrees for some k.at n=39A013935
- a(n) = T(n,n-2), T given by A026536. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 2.at n=11A026539
- Consider the trajectory of n under the iteration of a map which sends x to 3x - sigma(x) if this is >= 0; otherwise the iteration stops. The sequence gives values of n which eventually reach 0.at n=12A037159
- Sums of 3 distinct powers of 6.at n=19A038479
- Numerators of continued fraction convergents to sqrt(582).at n=2A042114
- Number of 6 X 6 binary matrices with n ones, with no zero rows or columns, up to row and column permutation.at n=17A056037
- Coefficient triangle of certain polynomials.at n=39A056588
- Fourth column sequence of triangle A056588.at n=5A056590
- Numbers k such that gcd(k, reverse(k)) = 27 = 3^3, where reverse(x) = A004086(x).at n=37A072016
- Second binomial transform of binomial(n+3, 3).at n=6A081895
- Numbers which are sums of two and also sums of three positive cubes.at n=16A085336
- Numbers which are sums of two, three and four cubes.at n=7A085337
- Numbers which are sums of two, three, four and also sums of five cubes.at n=6A085338
- Least k such that k*Mersenne-prime(n)-1 is prime.at n=21A098555
- Nearest k to j such that k*(2^j-1)-1 is prime where j=A000043(n) and 2^j-1 = Mersenne-prime(n) = A000668(n). If there are two k values equidistant from j, each of which produces a prime, the larger of the two gets added to the sequence.at n=21A101416
- Integer part of Sum_{k>=0} Sum_{j=0..k} n^j*A107045(k,j)/A107046(k,j).at n=19A107055
- Numbers with at least two 3s in their prime signature.at n=23A109399
- a(1)=9; a(n)=floor((47+sum(a(1) to a(n-1)))/5).at n=38A120177
- Unsigned version of A056588.at n=39A126770