11419
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12040
- Proper Divisor Sum (Aliquot Sum)
- 621
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10800
- Möbius Function
- 1
- Radical
- 11419
- 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
- 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
- a(n) = n*(5*n^2 - 2)/3.at n=19A004466
- Numbers k such that the continued fraction for sqrt(k) has period 86.at n=30A020425
- a(1) = 2; a(n) = half of the a(n-1)-th even nontotient number.at n=9A072416
- A Motzkin transform of Jacobsthal numbers.at n=8A112657
- If a(n) is a k-digit number, a(n+1) is the product of the number formed by the initial k-1 digits of a(n) and the final digit of a(n). If k=1, set a(n+1) = 0.at n=0A115753
- Odd winning positions in Fibonacci nim.at n=17A120904
- Multiples of 19 containing a 19 in their decimal representation.at n=18A121039
- Numbers m such that k = m*23^2 divides 3^(k-1) - 2^(k-1).at n=11A130058
- Lucas pseudoprimes.at n=10A217120
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..3 array extended with zeros and convolved with 1,2,2,1.at n=20A222106
- G.f.: x^2*(x+1)^2/(x^3+x^2-1)^2.at n=26A228364
- a(n) = Sum(psi(k-1)*psi(n-k-1),k=0..n)+(1-(-1)^n)/2, where psi(k) = A000931(k+6).at n=24A285187
- Sum of the fourth largest parts of the partitions of n into 10 parts.at n=39A326595
- Let b(1) = 2 and let b(n+1) be the least prime expressible as k*(b(n)-1)*b(n)+1; this sequence gives the values of k in order.at n=20A339174
- Composite numbers that contain only nonprime digits and whose prime factors contain only nonprime digits.at n=27A383934