3109
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
- 3110
- 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
- 3108
- Möbius Function
- -1
- Radical
- 3109
- 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
- 35
- 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
- 443
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes with 6 as smallest primitive root.at n=27A001125
- Numbers that are the sum of 8 positive 6th powers.at n=33A003364
- Numbers k such that the continued fraction for sqrt(k) has period 37.at n=7A020376
- Primes that remain prime through 2 iterations of function f(x) = 6x + 7.at n=42A023258
- Primes that remain prime through 2 iterations of the function f(x) = 8*x + 5.at n=23A023262
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = (primes).at n=17A024603
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = (primes).at n=16A025117
- a(n) = Sum_{i=0..2*n} Sum_{j=0..i} T(i, j), where T is given by A026552.at n=8A026567
- Lucky numbers with size of gaps equal to 10 (upper terms).at n=35A031893
- Lower prime of a difference of 10 between consecutive primes.at n=42A031928
- Upper prime of a difference of 20 between consecutive primes.at n=2A031939
- Primes of form x^2+35*y^2.at n=32A033224
- Primes of form x^2+69*y^2.at n=22A033244
- Primes of form x^2+83*y^2.at n=23A033253
- Base-7 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,0,3.at n=4A037691
- Numbers whose maximal base-6 run length is 4.at n=18A037987
- a(n) is the smallest prime number k such that k > n*pi(k), where pi(k) denotes the prime counting function.at n=6A038607
- Smallest prime p such that p/pi(p)>=n.at n=6A038623
- Numbers having four 4's in base 5.at n=13A043368
- Numbers having four 2's in base 6.at n=9A043380