11141
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12012
- Proper Divisor Sum (Aliquot Sum)
- 871
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10272
- Möbius Function
- 1
- Radical
- 11141
- 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
- 68
- 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
- Powers of fourth root of 12 rounded down.at n=15A018078
- Powers of fourth root of 12 rounded to nearest integer.at n=15A018079
- a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 positive integers congruent to 2 mod 3}.at n=11A024399
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (primes).at n=25A024604
- Numbers whose set of base-10 digits is {1,4}.at n=32A032822
- Number of inequivalent binary [ n,3 ] codes of dimension <= 3 without zero columns.at n=28A034337
- Numbers having four 1's in base 10.at n=15A043496
- Product of the digits of n divides the sum of the digits of n.at n=44A055931
- Numbers k such that the "inventory" A063850 of k is a palindrome.at n=12A079466
- 3-Smith numbers.at n=40A104391
- Near-repunit semiprimes.at n=25A105993
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 4 and 8.at n=28A136971
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 5 and 8.at n=18A136990
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 6 and 8.at n=27A136994
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 7 and 8.at n=25A136997
- Numbers k such that k and k^2 use only the digits 1, 2, 4 and 8.at n=9A136999
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 8 and 9.at n=23A137000
- Number of intersection points of all lines through pairs of vertices of a regular n-gon.at n=17A146212
- Numbers k such that continued fraction of (1 + sqrt(k))/2 has period 11.at n=43A146335
- Lexicographically earliest increasing sequence which lists the positions of the zero digits in the sequence.at n=32A167519