3251
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 3252
- 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
- 3250
- Möbius Function
- -1
- Radical
- 3251
- 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
- 136
- 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
- 458
- 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=29A001125
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/5.at n=9A001135
- 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=15A001275
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=17A001583
- Smallest prime p==3 (mod 8) such that Q(sqrt(-p)) has class number 2n+1.at n=15A002148
- Prime quadruples: numbers k such that k, k+2, k+6, k+8 are all prime.at n=8A007530
- a(0) = 1, a(n) = 9*n^2 + 2 for n>0.at n=19A010002
- a(n) is prime and sum of all primes <= a(n) is prime.at n=42A013917
- Coordination sequence T7 for Zeolite Code TER.at n=38A016439
- Expansion of 1/(1-x^10-x^11-x^12-x^13-x^14-x^15-x^16-x^17-x^18-x^19).at n=64A017895
- Powers of cube root of 2 rounded to nearest integer.at n=35A017980
- Powers of cube root of 2 rounded up.at n=35A017981
- Let q_k=p(p+2) be product of k-th pair of twin primes; sequence gives values of p such that (q_k)^2 > q_{k-i}q_{k+i} for all 1 <= i <= k-1.at n=28A021005
- Initial members of prime triples (p, p+2, p+6).at n=29A022004
- Primes that remain prime through 2 iterations of function f(x) = 6x + 1.at n=31A023256
- Squarefree n such that Q(sqrt(n)) has class number 5.at n=24A029705
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 57.at n=0A031555
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 57.at n=0A031735
- Four consecutive primes whose 'last digit cycle' equals {1,3,7,9}.at n=40A032591
- Initial terms of '4-block' primes as described in A032591.at n=10A032592