2351
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
- 2352
- 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
- 2350
- Möbius Function
- -1
- Radical
- 2351
- 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
- 58
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 349
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 3, 9, 11 (mod 20) such that 2p+1 is also prime.at n=34A000355
- a(n) = a(n-1) + a(n-2) with a(0)=2, a(1)=5. Sometimes called the Evangelist Sequence.at n=14A001060
- Smallest prime == 7 (mod 8) where Q(sqrt(-p)) has class number 2n+1.at n=31A002146
- a(n) = least primitive factor of 2^(2n+1) - 1.at n=23A002184
- Related to representation as sums of squares.at n=12A002292
- Primes of the form k^2 - k - 1.at n=27A002327
- Lucasian primes: p == 3 (mod 4) with 2*p+1 prime.at n=35A002515
- Divisors of 2^47 - 1.at n=1A003552
- Coordination sequence T1 for Zeolite Code DFO.at n=37A009875
- a(0) = 1, a(n) = 29*n^2 + 2 for n>0.at n=9A010019
- a(n) = F(n+1) + L(n), where F(n) and L(n) are Fibonacci and Lucas numbers, respectively.at n=15A013655
- Odd primes such that (3p+1)/2 and 3p+4 are also prime.at n=23A014223
- Smallest prime factor of Mersenne numbers 2^p-1, where p is prime.at n=14A016047
- Smallest nonempty set S containing prime divisors of 8k+7 for each k in S.at n=32A020620
- Primes that remain prime through 2 iterations of function f(x) = 9x + 4.at n=34A023266
- Numbers whose least quadratic nonresidue (A020649) is 13.at n=5A025025
- Expansion of 1/((1-2x)(1-4x)(1-6x)(1-7x)).at n=3A025965
- a(n) = n + (n+1)^2.at n=47A028387
- a(n) = prime(10*n - 1).at n=34A031376
- a(n) = prime(9*n - 2).at n=38A031383