6121
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
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6122
- 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
- 6120
- Möbius Function
- -1
- Radical
- 6121
- 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
- 173
- 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
- 798
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/4.at n=37A001134
- Primes p == 1 (mod 8), p = a^2 +64*b^2 such that y^2 = x^3 + p*x has rank 0.at n=28A007765
- Expansion of tan(x)*cos(sin(x)).at n=4A009727
- Expansion of e.g.f.: tanh(x)*exp(sinh(x)).at n=9A009829
- Fibonacci sequence beginning 2, 15.at n=14A022117
- Primes that remain prime through 2 iterations of the function f(x) = 8*x + 5.at n=44A023262
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=47A024840
- a(n) is the least prime > a(n-1) whose digits do not appear in a(n-1).at n=22A030284
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 48 ones.at n=11A031816
- Numbers whose set of base-14 digits is {2,3}.at n=21A032814
- Multiplicity of highest weight (or singular) vectors associated with character chi_190 of Monster module.at n=38A034578
- Numerators of continued fraction convergents to sqrt(233).at n=9A041434
- Numerators of continued fraction convergents to sqrt(866).at n=5A042672
- Primes with first digit 6.at n=32A045712
- Primes followed by a [10,2,10] prime difference pattern of A001223.at n=10A052376
- Primes from products of split even-digit primes.at n=25A053008
- Fourth spoke of a hexagonal spiral.at n=45A056108
- First member of a prime triple in a 2p-1 progression.at n=30A057326
- Primes p such that x^56 = 2 has no solution mod p, but x^28 = 2 has a solution mod p.at n=38A059635
- Number of matchings in the wheel graph with n spokes.at n=13A061705