11219
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 877
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10344
- Möbius Function
- 1
- Radical
- 11219
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 112
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=31A025100
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 14 (most significant digit on left).at n=7A029483
- Numbers k such that sigma(k) divides sigma(k+1), where sigma(k) is sum of positive divisors of k.at n=19A058072
- Numbers k such that gcd(sigma(k), sigma(k+1)) > k.at n=30A066025
- Numbers k such that 2 + 2^k + 3^k is prime.at n=10A076513
- Numbers k such that sigma(k+1) = 3 * sigma(k).at n=3A077087
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.at n=37A078970
- Number of partitions of n into numbers having in binary representation at most trailing zeros.at n=41A087750
- a(n) = T(p(n)) - p(T(n)) = Commutator[triangular numbers, primes] at n.at n=45A123907
- a(0)=1, a(1)=3, a(n) = 8*a(n-1) - a(n-2).at n=5A144479
- a(n)=a(n-1)+2*a(n-2)-[a(n-1)/2]-[a(n-4)/2]-[a(n-5)/2].at n=20A173534
- Number of partitions of 10^n into 2 composite relatively prime parts.at n=5A190681
- x-values in the solution to 15*x^2 - 14 = y^2.at n=9A199336
- Principal diagonal of the convolution array A213844.at n=12A213845
- Numbers n such that in Collatz (3x+1) trajectory of n, the number of terms < n equals number of terms > n.at n=27A217731
- Consider the succession rule (x, y, z) -> (z, y+z, x+y+z). Sequence gives z values starting at (0, 1, 2).at n=11A219788
- a(n) = 6*F(n)*F(n+1) + (-1)^n, where F = A000045.at n=9A264080
- Ulam numbers u such that 5*u is also an Ulam number.at n=20A287613
- Number of integer partitions of n whose multiplicities appear with relatively prime multiplicities.at n=33A319160
- Numbers k such that 24*k-1 has at least three factors 7 and the partition function evaluated at k has at least the same number of factors 7 as 24*k-1.at n=13A340957