343
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 400
- Proper Divisor Sum (Aliquot Sum)
- 57
- 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
- 294
- Möbius Function
- 0
- Radical
- 7
- Omega Function (Ω)
- 3
- 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
- yes
- 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
- 125
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- dreihundertdreiundvierzig· ordinal: dreihundertdreiundvierzigste
- English
- three hundred forty-three· ordinal: three hundred forty-third
- Spanish
- trescientos cuarenta y tres· ordinal: 343º
- French
- trois cent quarante-trois· ordinal: trois cent quarante-troisième
- Italian
- trecentoquarantatre· ordinal: 343º
- Latin
- trecenti quadraginta tres· ordinal: 343.
- Portuguese
- trezentos e quarenta e três· ordinal: 343º
Appears in sequences
- a(n) = floor(n^(3/2)).at n=49A000093
- Maximum m such that there are no two adjacent elements belonging to the same n-th power residue class modulo some prime p in the sequence 1,2,...,m (equivalently, there is no n-th power residue modulo p in the sequence 1/2,2/3,...,(m-1)/m).at n=5A000236
- Powers of 7: a(n) = 7^n.at n=3A000420
- The cubes: a(n) = n^3.at n=7A000578
- Number of primes <= product of first n primes, A002110(n).at n=5A000849
- a(n) = least m such that if a/b < c/d where a,b,c,d are integers in [0,n], then a/b < k/m < c/d for some integer k.at n=22A001000
- a(n) = a(n-1) + a(n-2) with a(0)=2, a(1)=5. Sometimes called the Evangelist Sequence.at n=10A001060
- Numbers that are the sum of 4 cubes in more than 1 way.at n=15A001245
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)).at n=23A001304
- Number of ways of making change for n cents using coins of 1, 2, 4, 10 cents.at n=46A001362
- Number of ways of making change for n cents using coins of 1, 2, 4, 10 cents.at n=47A001362
- Number of unlabeled mappings (or mapping patterns) from n points to themselves; number of unlabeled endofunctions.at n=7A001372
- Perfect powers: m^k where m > 0 and k >= 2.at n=25A001597
- Nearest integer to 2*n*log(n).at n=45A001618
- Powerful numbers, definition (1): if a prime p divides n then p^2 must also divide n (also called squareful, square full, square-full or 2-powerful numbers).at n=29A001694
- Number of permutations of (1,...,n) having n-3 inversions (n>=3).at n=5A001893
- Central polygonal numbers: a(n) = n^2 - n + 1.at n=19A002061
- Palindromes in base 10.at n=43A002113
- a(n) is the number of partitions of 3n that can be obtained by adding together three (not necessarily distinct) partitions of n.at n=6A002220
- Numbers k such that 9*2^k - 1 is prime.at n=13A002236