11227
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11440
- Proper Divisor Sum (Aliquot Sum)
- 213
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11016
- Möbius Function
- 1
- Radical
- 11227
- 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
- a(n) = floor( n*(n-1)*(n-2)/28 ).at n=69A011910
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 27 ones.at n=2A031795
- a(n) is the smallest composite number c such that A002110(n) + c is prime.at n=26A038771
- n-th 4k+1 prime times (n+1)st 4k+3 prime.at n=12A048628
- a(n) = floor(47*(n-3/2)^(3/2)).at n=38A050256
- Odd composite numbers which in base 2 contain their largest proper factor as a substring of digits.at n=23A063131
- Composite numbers not divisible by 2, 3, 5 or 7 which in base 2 contain their largest proper factor as a substring.at n=19A063138
- Prefixing, suffixing or inserting a 9 in the number anywhere gives a prime.at n=43A069833
- Least composite number not congruent to 0 (modulo the first n primes) which contains its greatest proper divisor as a substring of itself, both in base two.at n=24A077658
- Least composite number not congruent to 0 (modulo the first n primes) which contains its greatest proper divisor as a substring of itself, both in base two.at n=25A077658
- Least composite number not congruent to 0 (modulo the first n primes) which contains its greatest proper divisor as a substring of itself, both in base two.at n=26A077658
- a(n) = (6*n+1)*(6*n+7).at n=17A085026
- a(n) = prime(n)*prime(n+2).at n=26A090076
- Product of the n-th sexy prime pair.at n=17A111192
- Least n-digit number m such that m and m^10 are zeroless.at n=4A124651
- Least k such that n^k mod k = n-1.at n=26A128149
- a(n) = least k such that the remainder when 29^k is divided by k is n.at n=27A128369
- Numbers having exactly two distinct prime factors p, q with q = p+6.at n=33A143205
- Second bisection of A061039.at n=51A144450
- Smallest precursor of n-th cycle in the "Recurring Digital Invariant Variant" problem.at n=26A151543