11441
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12132
- Proper Divisor Sum (Aliquot Sum)
- 691
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10752
- Möbius Function
- 1
- Radical
- 11441
- 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
- 81
- 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
- Squares written in base 6.at n=41A001741
- Euler characteristics of polytopes.at n=16A006481
- Pseudoprimes to base 58.at n=38A020186
- Pseudoprimes to base 84.at n=28A020212
- Numbers k such that the continued fraction for sqrt(k) has period 41.at n=22A020380
- a(n) = least m such that if r and s in {1/1, 1/4, 1/7, ..., 1/(3n-2)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=47A024836
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 8.at n=21A031421
- Numbers whose set of base-10 digits is {1,4}.at n=36A032822
- a(n) = (n + 2)*(2*n^2 - n + 3)/6.at n=32A056520
- a(n) = n*(7*n^2-4)/3.at n=17A063521
- Numbers n such that 2*(10^n-1)/3+(10^(n-1)+1) or (69*10^(n-1)+3)/9 is a plateau or depression prime.at n=7A082714
- Number of walks of length n between two nodes at distance 2 in the cycle graph C_9.at n=14A095367
- a(n) = (n^3 - 7*n + 12)/6.at n=40A105163
- a(n) = binomial(n, 9) + 1.at n=16A115205
- a(n) is the number of integer lattice points inside the right triangle with legs 3n and 4n (and hypotenuse 5n).at n=43A126587
- Number of Dyck n-paths all of whose ascents have lengths equal to 1 (mod 8).at n=16A212388
- Sum of the two smallest parts from the partitions of 4n into 4 parts with smallest part = 1.at n=25A239059
- Number of partitions of n with difference -4 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=41A242688
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=28A245208
- Number of length n+3 0..2 arrays with some pair in every consecutive four terms totalling exactly 2.at n=5A245945