349
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 350
- 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
- 348
- Möbius Function
- -1
- Radical
- 349
- 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
- 32
- Smith 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
- 70
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- dreihundertneunundvierzig· ordinal: dreihundertneunundvierzigste
- English
- three hundred forty-nine· ordinal: three hundred forty-ninth
- Spanish
- trescientos cuarenta y nueve· ordinal: 349º
- French
- trois cent quarante-neuf· ordinal: trois cent quarante-neufième
- Italian
- trecentoquarantanove· ordinal: 349º
- Latin
- trecenti quadraginta novem· ordinal: 349.
- Portuguese
- trezentos e quarenta e nove· ordinal: 349º
Appears in sequences
- Coefficients of the 3rd-order mock theta function f(q).at n=43A000025
- Coefficient of q^(2n-1) in the series expansion of Ramanujan's mock theta function f(q).at n=21A000199
- Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) with a(0) = a(1) = a(2) = a(3) = 1.at n=11A000288
- Primes p of the form 3k+1 such that Sum_{x=1..p} cos(2*Pi*x^3/p) > sqrt(p).at n=17A000921
- 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=20A000960
- Union of all numbers {p, q} where p and q are both primes or powers of primes and q = p+2.at n=57A001092
- Twin primes.at n=40A001097
- Primes with primitive root 2.at n=28A001122
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=40A001915
- Primes p such that the congruence 2^x = 5 (mod p) is solvable.at n=37A001916
- From a Goldbach conjecture: records in A185091.at n=12A002092
- Pythagorean primes: primes of the form 4*k + 1.at n=32A002144
- Primitive roots that go with the primes in A029932.at n=19A002231
- Primes congruent to 1 or 2 modulo 4; or, primes of form x^2 + y^2; or, -1 is a square mod p.at n=33A002313
- Numerators of convergents to cube root of 2.at n=7A002352
- Let p = A007645(n) be the n-th generalized cuban prime and write p^2 = x^2 + 3*y^2 with y > 0; a(n) = x.at n=34A002367
- Primes of the form 6m + 1.at n=32A002476
- Numbers k such that (k^2 + 1)/2 is prime.at n=55A002731
- Numbers k such that (4*k^2 + 1)/5 is prime.at n=55A002732
- a(n) = n + Sum_{k=1..n} pi(k), where pi() = A000720.at n=41A002815