11183
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
- 11448
- Proper Divisor Sum (Aliquot Sum)
- 265
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10920
- Möbius Function
- 1
- Radical
- 11183
- 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) = [ 2nd elementary symmetric function of {sqrt(k+1)} ], k = 1,2,...,n.at n=34A025219
- "AGK" (ordered, elements, unlabeled) transform of 2,1,1,1,...at n=20A032024
- Numbers whose base-7 representation contains exactly four 4's.at n=13A043412
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=4A045156
- Semiprimes k=p*q such that the polynomial (1+x)^k (mod k) has p+q nonzero terms.at n=37A116926
- Smallest number m such that prime(n) is a factor of both m and sigma(m).at n=15A156099
- Numbers n such that 4(10^n-1)/9 * 10^ceiling(log_10(n+1)) + n is prime.at n=3A176089
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=24A245208
- Least semiprime of a run of exactly n odd semiprimes.at n=15A304457
- a(n) = Sum_{k=1..n} k * tau(k)^2, where tau is A000005.at n=31A320896
- Products of exactly two distinct primes in A090252, in order of appearance.at n=54A354160
- Products of exactly two distinct odd primes in A090252, in order of appearance.at n=52A354162
- Numbers k such that A361338(k) = 8.at n=31A361347
- Numbers m such that Stern polynomial B(m,x) has no irreducible polynomial factors that themselves are Stern polynomials. The initial a(1) = 1 is included by convention.at n=14A389918