1193
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1194
- 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
- 1192
- Möbius Function
- -1
- Radical
- 1193
- 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
- 101
- 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
- 196
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of inequivalent planar partitions of n, when considering them as 3D objects.at n=15A000786
- Primes with 3 as smallest primitive root.at n=46A001123
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/4.at n=10A001134
- Smallest prime p such that the product of q/(q-1) over the primes from prime(n) to p is greater than 2.at n=10A001275
- Number of different keys with n cuts, depths between 1 and 7 and depth difference at most 1 between adjacent cut depths.at n=6A002714
- Erroneous version of A016054.at n=7A006031
- Number of elements in Z[ sqrt(-2) ] whose 'smallest algorithm' is <= n.at n=13A006459
- Emirps (primes whose reversal is a different prime).at n=49A006567
- Primes with both 10 and -10 as primitive root.at n=37A007349
- Primes of form 8n+1, that is, primes congruent to 1 mod 8.at n=43A007519
- Primes p == 1 (mod 8), p = a^2 + 64*b^2 such that y^2 = x^3 + p*x has rank 2.at n=15A007766
- Least m such that if a/b < c/d are Farey fractions of order n then there exists k such that a/b < k/m < c/d, k/m reduced.at n=39A009571
- a(n) = prime(n^2).at n=13A011757
- Primes p == 1 mod 8 such that 2 and -2 are both 4th powers (one implies other) mod p.at n=18A014754
- q-Fibonacci numbers for q=2, scale a(n-1).at n=5A015473
- Numbers k such that sigma(k) + 8 = sigma(k+8).at n=44A015915
- Primes that are palindromic in base 2 (but written here in base 10).at n=11A016041
- Numbers n such that (13^n - 1)/12 is prime.at n=7A016054
- The smallest representative in a cycle of circular primes, where circular primes are numbers that remain prime under cyclic shifts of digits.at n=13A016114
- Expansion of 1/(1-x^8-x^9-x^10-x^11-x^12-x^13-x^14-x^15).at n=50A017873