11389
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13024
- Proper Divisor Sum (Aliquot Sum)
- 1635
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9756
- Möbius Function
- 1
- Radical
- 11389
- 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
- 174
- 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) = (2n)! * Sum_{k=0..n} (-1)^k * binomial(n,k) / (n+k)!.at n=5A006902
- Powers of fifth root of 7 rounded to nearest integer.at n=24A018133
- Powers of fifth root of 7 rounded up.at n=24A018134
- Smallest number m with nonzero digits such that A046810(m)=n.at n=17A046813
- Array read by antidiagonals upwards: h(n,k) = number of sequences with n copies each of 1,2,...,k and longest increasing subsequence of length k (n>=1, k>=1).at n=19A047909
- Row sums of signed triangle A062138 (generalized a=5 Laguerre).at n=5A062191
- Floor of area of triangle with consecutive prime sides.at n=36A096377
- Indices of primes in sequence defined by A(0) = 93, A(n) = 10*A(n-1) + 13 for n > 0.at n=7A101007
- Number of digits in A110780(n).at n=7A110781
- Smallest k such that k^2 + 1 is divisible by A002144(n)^3.at n=5A145296
- Numbers k such that k^2 + 1 == 0 (mod 41^2).at n=13A157116
- a(n) = 343*n - 273.at n=33A157369
- a(n) is the number of patterns for n-digit papaya numbers.at n=12A165136
- a(n) is the number of patterns for n-character papaya words in an infinite alphabet.at n=13A165137
- Number of DUU's in all length n left factors of Dyck paths; here U=(1,1) and D=(1,-1).at n=15A191796
- A002110(n)-(p[i]+p[i+1]+...+p[i+n-1]), where p[i] is the largest prime such that this is nonnegative.at n=56A196129
- Number of 0..n arrays x(0..5) of 6 elements with zero 4th differences.at n=21A200084
- Number of (w,x,y,z) with all terms in {1,...,n} and w+x=|x-y|+|y-z|.at n=28A212676
- a(n) is smallest number such that a(n)^2 + 1 is divisible by 41^n.at n=3A218714
- Partial sums of A256970.at n=28A256971