11714
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17574
- Proper Divisor Sum (Aliquot Sum)
- 5860
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5856
- Möbius Function
- 1
- Radical
- 11714
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 143
- 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
- yes
- Odd
- no
Appears in sequences
- Base-2 digital convolution sequence.at n=37A033639
- Expansion of (1-x)/(1-2*x-3*x^2+3*x^3).at n=10A052538
- First of 3 or more consecutive integers with equal values of phi(phi(n)).at n=18A167767
- Numbers m such that A006218(m) is a perfect square.at n=32A175345
- Position where 10^n-1 occurs in the Kaprekar sequence A006886.at n=30A193992
- Number of 2 X 2 matrices having all terms in {1,...,n} and positive even determinant.at n=13A211067
- Number of nondecreasing -3..3 vectors of length n whose dot product with some lexicographically greater or equal nondecreasing -3..3 vector equals n.at n=10A226417
- Number of (n+2)X(1+2) 0..3 arrays with each 3X3 subblock having the sum of its 72 absolute element differences equal to 52, and no adjacent elements equal.at n=1A234862
- Number of (n+2)X(2+2) 0..3 arrays with each 3X3 subblock having the sum of its 72 absolute element differences equal to 52, and no adjacent elements equal.at n=0A234863
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with each 3X3 subblock having the sum of its 72 absolute element differences equal to 52, and no adjacent elements equal.at n=1A234867
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with each 3X3 subblock having the sum of its 72 absolute element differences equal to 52, and no adjacent elements equal.at n=2A234867
- a(0)=-1, a(1)=1; a(n) = n*a(n-1) + (n-2)*a(n-2) + Sum_{j=1..n-1} a(j)*a(n-j) + 2*Sum_{j=0..n-1} a(j)*a(n-1-j).at n=9A259872
- G.f. A(x) satisfies: A(x) = 1/(1 + (-x)^a(0)/(1 + (-x)^a(1)/(1 + (-x)^a(2)/(1 + (-x)^a(3)/(1 + ...))))), a continued fraction.at n=17A307543
- Expansion of Sum_{k>=1} phi(k) * x^k/(1 - x^k)^4, where phi = Euler totient function (A000010).at n=38A309323
- a(n) = pi(n) * (Sum_{n <= q < 2n, q prime} q) + (pi(2n-1) - pi(n-1)) * (Sum_{p <= n, p prime} p).at n=42A352775
- Numbers k such that A380459(k) has no divisors of the form p^p, while A003415(k) has such a divisor or is 0.at n=43A380474