143
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
- 168
- Proper Divisor Sum (Aliquot Sum)
- 25
- 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
- 120
- Möbius Function
- 1
- Radical
- 143
- 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
- 103
- 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
- einshundertdreiundvierzig· ordinal: einshundertdreiundvierzigste
- English
- one hundred forty-three· ordinal: one hundred forty-third
- Spanish
- ciento cuarenta y tres· ordinal: 143º
- French
- cent quarante-trois· ordinal: cent quarante-troisième
- Italian
- centoquarantatre· ordinal: 143º
- Latin
- centum quadraginta tres· ordinal: 143.
- Portuguese
- cento e quarenta e três· ordinal: 143º
Appears in sequences
- a(n) = Fibonacci(n) - 1.at n=11A000071
- One-half of number of permutations of [n] with exactly one run of adjacent symbols differing by 1.at n=5A000239
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=56A000277
- Number of binary necklaces of length n with no subsequence 00, excluding the necklace "0".at n=15A000358
- a(n) = 4*n^2 - 1.at n=6A000466
- 1 together with products of 2 or more distinct primes.at n=54A000469
- Number of steps to reach 1 in sequence A000546.at n=11A000547
- Boustrophedon transform of partition numbers.at n=5A000751
- Total number of 1's in binary expansions of 0, ..., n.at n=52A000788
- Number of bond-rooted polyenoids with n edges.at n=5A000913
- Fermat coefficients.at n=4A000970
- Dimensions (sorted, with duplicates removed) of real simple Lie algebras.at n=38A001066
- Triangle read by rows, in which row n consists of n(n+m) for m = 1 .. n-1.at n=46A001283
- Numbers of form m*k with m+1 <= k <= 2m-1.at n=38A001284
- Semiprimes (or biprimes): products of two primes.at n=47A001358
- Numbers with an odd number of digits.at n=53A001633
- a(n) = a(n-2) + a(n-3) + a(n-4), with initial values a(0) = 0, a(1) = 2, a(2) = 3, a(3) = 6.at n=12A001634
- A Fielder sequence: a(n) = a(n-1) + a(n-2) - a(n-7), n >= 8.at n=10A001636
- Coefficients of Legendre polynomials.at n=3A001796
- Upper Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi^2), where phi = (1+sqrt(5))/2.at n=54A001950