11772
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 30800
- Proper Divisor Sum (Aliquot Sum)
- 19028
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3888
- Möbius Function
- 0
- Radical
- 654
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 174
- 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
- Sorted Galois numbers.at n=32A028689
- Product of a prime and the previous number.at n=28A036689
- Number of partitions satisfying cn(0,5) + cn(2,5) <= cn(1,5) and cn(0,5) + cn(2,5) <= cn(4,5) and cn(0,5) + cn(3,5) <= cn(1,5) and cn(0,5) + cn(3,5) <= cn(4,5).at n=45A039883
- Number of partitions satisfying cn(2,5) < cn(1,5) + cn(4,5) and cn(3,5) < cn(1,5) + cn(4,5).at n=35A039889
- Expansion of 1/((1-x)*(1-x^2)^2*(1-x^3)^2*(1-x^4)^2*(1-x^5)*(1-x^6)).at n=27A045513
- Hexagonal matchstick numbers: a(n) = 3*n*(3*n+1).at n=36A045945
- Smallest oblong (promic) number containing exactly n 7's.at n=1A048544
- Numbers k such that sigma(k) = 2*usigma(k).at n=34A063880
- a(n) = product of numbers from prime(n)+1 up to prime(n+1), where prime(n) is the n-th prime.at n=27A072472
- Sum of divisors of numbers containing in their decimal representation only the digits 0 and 1.at n=28A077810
- Numbers of the form p^3 + q^3, p, q primes.at n=34A086119
- a(n) = smallest k such that (10^k-1)/9 == 0 mod prime(n)^2, or 0 if no such k exists.at n=28A087094
- Coefficient triangle of polynomials used for numerator of g.f.s for column sequences of array A078739.at n=8A089275
- Antidiagonal sums of the square array A096583, in which the n-th diagonal equals the convolution of the n-th row with the antidiagonal sums (this sequence).at n=15A096584
- Sums of two distinct prime cubes.at n=27A120398
- Triangle read by rows: numbers of isomers of unbranched a-4-catapolynonagons.at n=36A120650
- Unbranched a-4-catapolynonagons (see Brunvoll reference for precise definition).at n=6A121123
- a(n) = 3a(n-1) + 3a(n-2). a(0) = 1, a(1) = 4.at n=7A125145
- a(n) = (p+2)!/p! where p is the n-th lesser twin prime, A001359(n).at n=9A126251
- Triangle read by rows: T(n,k) is the number of sequences of length n on the alphabet {0,1,2,3}, containing k subsequences 00 (0<=k<=n-1).at n=22A128235