12188
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23352
- Proper Divisor Sum (Aliquot Sum)
- 11164
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5520
- Möbius Function
- 0
- Radical
- 6094
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 63
- 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
- Theta series of P_{11a} packing.at n=4A005953
- Numbers k such that k^4 + 1, (k+2)^4 + 1 and (k+4)^4 + 1 are all primes.at n=12A073476
- Structured tetragonal anti-prism numbers.at n=21A100182
- a(n) = sum of cubes of the coefficients of x^n in x^(n-3k)*A(x^3)^(n-3k+1), as k varies from 0 to floor(n/3) for n>0, with a(0)=1.at n=11A121643
- Number of n X n arrays of squares of integers with every (n-3) X (n-3) subblock summing to 4 and every element equal to at least one neighbor.at n=3A146123
- Row sums of triangle T(j,k) = (j^k) mod (j*k) for 1 <= k <= j (see A096133).at n=43A157351
- a(n) = 1331*n - 1122.at n=9A157441
- Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,7}) exceeds the largest prime factor of product(n+k, {k,0,7}).at n=19A199407
- Alternating LCM-sum: a(n) = Sum_{k=1..n} (-1)^(k-1)*lcm(k,n).at n=43A199806
- Number of (n+3) X 8 0..2 matrices with each 4 X 4 subblock idempotent.at n=8A224725
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having a sum of two or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=20A227259
- Number of triangles, distinct up to congruence, on a centered hexagonal grid of size n.at n=10A241231
- Number of (n+2) X (1+2) 0..1 arrays with every 2 X 2 and 3 X 3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=22A253503
- Numbers k such that 483*2^k+1 is prime.at n=31A320339
- Number of strict compositions of n that are neither unimodal nor is their negation.at n=27A332874
- a(n) = Sum_{x_1|n, x_2|n, x_3|n, x_4|n, x_5|n} gcd(x_1,x_2,x_3,x_4,x_5).at n=51A344139
- Number of integer partitions of n whose parts do not have the same mean as median.at n=34A359894