1093
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
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1094
- 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
- 1092
- Möbius Function
- -1
- Radical
- 1093
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 31
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 183
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Maximal number of regions obtained by joining n points around a circle by straight lines. Also number of regions in 4-space formed by n-1 hyperplanes.at n=13A000127
- Moser-de Bruijn sequence: sums of distinct powers of 4.at n=43A000695
- Primes p of the form 3k+1 such that Sum_{x=1..p} cos(2*Pi*x^3/p) > sqrt(p).at n=46A000921
- Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=36A000960
- Primes with 5 as smallest primitive root.at n=27A001124
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/3.at n=17A001133
- Wieferich primes: primes p such that p^2 divides 2^(p-1) - 1.at n=0A001220
- a(n) = least value of m for which Liouville's function A002819(m) = -n.at n=35A002053
- Largest prime factor of 3^(2n+1) - 1.at n=3A002591
- Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6*k*(k-1) + 1.at n=13A003154
- Numbers that are the sum of 8 positive 5th powers.at n=36A003353
- Primes of form (p^x - 1)/(p^y - 1), p prime.at n=11A003424
- a(n) = (3^n - 1)/2.at n=7A003462
- Numbers divisible only by primes congruent to 1 mod 7.at n=32A004619
- Class 4+ primes (for definition see A005105).at n=15A005108
- Primes p such that (p+1)/2 is prime.at n=21A005383
- Primes of form k^2 + 4.at n=8A005473
- Greater of twin primes.at n=39A006512
- Denominators of worst case for Engel expansion.at n=24A006540
- Number of free subsets of multiplicative group of GF(3^n).at n=6A007231