1741
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1742
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 1740
- Möbius Function
- -1
- Radical
- 1741
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 29
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 271
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(0) = 1, a(1) = 4, and a(n) = a(n-1) + a(n-2) for n >= 2.at n=14A000285
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=25A000923
- Euclid-Mullin sequence: a(1) = 2, a(n+1) is smallest prime factor of 1 + Product_{k=1..n} a(k).at n=18A000945
- Centered square numbers: a(n) = 2*n*(n+1)+1. Sums of two consecutive squares. Also, consider all Pythagorean triples (X, Y, Z=Y+1) ordered by increasing Z; then sequence gives Z values.at n=29A001844
- Generalized divisor function. Number of partitions of n with exactly three part sizes.at n=28A002134
- Primitive prime factors of the sequence k^2 + 1 (A002522) in the order that they are found.at n=40A005529
- Primes with both 10 and -10 as primitive root.at n=50A007349
- Numbers k such that (3^k + 1)/4 is prime.at n=12A007658
- Smallest odd number expressible in at least n ways as p+2*m^2 where p is 1 or a prime and m >= 0.at n=22A007697
- Coordination sequence T10 for Zeolite Code EUO.at n=26A008096
- Coordination sequence T4 for Zeolite Code EUO.at n=26A008099
- Coordination sequence T2 for Zeolite Code MTN.at n=25A008187
- Number of triples of different integers from [ 2,n ] with no global factor.at n=23A015618
- Numbers k such that the continued fraction for sqrt(k) has period 69.at n=1A020408
- Smallest nonempty set S containing prime divisors of 5k+2 for each k in S.at n=28A020596
- Smallest nonempty set S containing prime divisors of 8k+3 for each k in S.at n=45A020617
- Smallest nonempty set S containing prime divisors of 10k+4 for each k in S.at n=29A020634
- Place where n-th 1 occurs in A023127.at n=37A022789
- Primes that remain prime through 2 iterations of function f(x) = x + 6.at n=43A023241
- Primes that remain prime through 2 iterations of the function f(x) = 2x + 9.at n=38A023245