1171
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1172
- 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
- 1170
- Möbius Function
- -1
- Radical
- 1171
- 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
- 57
- 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
- 193
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p of the form 3k+1 such that Sum_{x=1..p} cos(2*Pi*x^3/p) > sqrt(p).at n=49A000921
- Number of partitions of n into nonprime parts.at n=41A002095
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=51A003147
- Primes p such that 2p-1 is also prime.at n=37A005382
- Prime-indexed primes: primes with prime subscripts.at n=43A006450
- From relations between Siegel theta series.at n=8A006476
- Percolation series for f.c.c. lattice.at n=3A006812
- Number of elements (a b, c d) in GL(2,Z) with |det| = 1, trace <= n and 0 <= a <= {b, c} <= d.at n=51A007295
- Primes == 3 (mod 8).at n=49A007520
- Primes that divide at least one term of Sylvester's sequence s = A000058: s(n+1) = s(n)^2 - s(n) + 1, s(0) = 2.at n=11A007996
- Coordination sequence T1 for Zeolite Code MTT.at n=21A008189
- Coordination sequence for 4-dimensional lonsdaleite (or wurtzite).at n=9A008524
- Coordination sequence T2 for Zeolite Code ZON.at n=24A009920
- Coordination sequence T3 for Zeolite Code ZON.at n=24A009921
- Number of triples (i,j,k) with 1 <= i < j < k <= n and gcd(i,j,k) = 1.at n=20A015616
- Numbers k such that the continued fraction for sqrt(k) has period 26.at n=22A020365
- Primes that contain digits 1 and 7 only.at n=5A020455
- Describe previous term from the right (method B - initial term is 7).at n=2A022518
- n-th prime p(k) such that p(k) + p(k+6) = p(k+2) + p(k+4).at n=26A022891
- Numbers m such that m and 2*m + 5 are both prime.at n=53A023205