3419
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3696
- Proper Divisor Sum (Aliquot Sum)
- 277
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3144
- Möbius Function
- 1
- Radical
- 3419
- 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
- 149
- 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
- Coordination sequence T5 for Zeolite Code MFS.at n=36A008177
- Coordination sequence T2 for Zeolite Code -PAR.at n=41A009856
- a(n) is least k such that k and 5k are anagrams in base n (written in base 10).at n=8A023097
- a(n) = [ 2nd elementary symmetric function of {sqrt(k+1)} ], k = 1,2,...,n.at n=22A025219
- Coordination sequence T1 for Zeolite Code ITE.at n=40A027369
- Exactly 5 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a lucky number.at n=16A032701
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 5).at n=52A035572
- Number of partitions of n into parts not of form 4k+2, 12k, 12k+3 or 12k-3.at n=51A036018
- Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5) + cn(2,5) and cn(0,5) < cn(1,5) + cn(4,5) + cn(3,5).at n=27A039846
- The sequence e when b=[ 1,1,0,1,1,... ].at n=40A042955
- Numbers whose base-15 representation has exactly 4 runs.at n=27A043671
- Numbers k such that string 1,9 occurs in the base 10 representation of k but not of k-1.at n=38A044351
- Numbers n such that string 1,9 occurs in the base 10 representation of n but not of n+1.at n=38A044732
- Numbers n such that string 4,1 occurs in the base 10 representation of n but not of n+1.at n=37A044754
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049639.at n=50A049640
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=37A050037
- Composite and every divisor (except 1) contains the digit 3.at n=42A062668
- Numbers n such that sigma(n+2) - sigma(n) = prime(n+2) - prime(n).at n=8A067058
- Prime(n)*prime(2*n)+prime(n)+prime(2*n).at n=11A072672
- a(n) = (prime(n)+1)*n - 1.at n=29A083723