341
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 384
- Proper Divisor Sum (Aliquot Sum)
- 43
- 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
- 300
- Möbius Function
- 1
- Radical
- 341
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 11
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- dreihunderteinundvierzig· ordinal: dreihunderteinundvierzigste
- English
- three hundred forty-one· ordinal: three hundred forty-first
- Spanish
- trescientos cuarenta y uno· ordinal: 341º
- French
- trois cent quarante et un· ordinal: trois cent quarante et unième
- Italian
- trecentoquarantuno· ordinal: 341º
- Latin
- trecenti quadraginta unus· ordinal: 341.
- Portuguese
- trezentos e quarenta e um· ordinal: 341º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=50A000008
- Number of positive integers <= 2^n of form x^2 + 12 y^2.at n=11A000021
- Number of positive integers <= 2^n of the form 3*x^2 + 4*y^2.at n=11A000049
- a(n) = floor(n^2/3).at n=32A000212
- Octagonal numbers: n*(3*n-2). Also called star numbers.at n=11A000567
- Moser-de Bruijn sequence: sums of distinct powers of 4.at n=31A000695
- Erroneous version of A007535.at n=1A000783
- Erroneous version of A007535.at n=14A000783
- Primary pretenders: least composite c such that n^c == n (mod c).at n=2A000790
- a(n) = floor(2^n / n).at n=11A000799
- a(2n) = 2*a(2n-1), a(2n+1) = 2*a(2n)+1 (also a(n) is the n-th number without consecutive equal binary digits).at n=9A000975
- Jacobsthal sequence (or Jacobsthal numbers): a(n) = a(n-1) + 2*a(n-2), with a(0) = 0, a(1) = 1; also a(n) = nearest integer to 2^n/3.at n=10A001045
- Generalized octagonal numbers: k*(3*k-2), k=0, +- 1, +- 2, +-3, ...at n=21A001082
- a(n) = sigma_2(n): sum of squares of divisors of n.at n=15A001157
- Numbers that are the sum of 4 cubes in more than 1 way.at n=14A001245
- Associated Mersenne numbers.at n=15A001351
- a(n) is the number of partitions of n into at most 3 parts; also partitions of n+3 in which the greatest part is 3; also number of unlabeled multigraphs with 3 nodes and n edges.at n=61A001399
- Sum of rows of triangle defined in A001404.at n=7A001410
- Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers.at n=0A001567
- A generalized Fibonacci sequence.at n=34A001584