373
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 374
- 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
- 372
- Möbius Function
- -1
- Radical
- 373
- 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
- 19
- Smith 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 74
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- dreihundertdreiundsiebzig· ordinal: dreihundertdreiundsiebzigste
- English
- three hundred seventy-three· ordinal: three hundred seventy-third
- Spanish
- trescientos setenta y tres· ordinal: 373º
- French
- trois cent soixante-treize· ordinal: trois cent soixante-treizième
- Italian
- trecentosettantatre· ordinal: 373º
- Latin
- trecenti septuaginta tres· ordinal: 373.
- Portuguese
- trezentos e setenta e três· ordinal: 373º
Appears in sequences
- a(n) = Sum_{k=0..n} p(k) where p(k) = number of partitions of k (A000041).at n=13A000070
- a(2n) = n+2, a(2n-1) = smallest number requiring n+2 letters in English.at n=48A000916
- Primes p of the form 3k+1 such that -sqrt(p) < sum_{x=1..p} cos(2*Pi*x^3/p) < sqrt(p).at n=10A000922
- Primes with primitive root 2.at n=29A001122
- Smallest natural number requiring n letters in English.at n=24A001166
- Number of letters in English name for n increases at these numbers.at n=17A001619
- Related to Zarankiewicz's problem.at n=25A001841
- Cyclic numbers: 10 is a quadratic residue modulo p and class of mantissa is 2.at n=22A001914
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=42A001915
- Primes p such that the congruence 2^x = 5 (mod p) is solvable.at n=39A001916
- Number of symmetric filaments (strip polyominoes) with n square cells.at n=16A002014
- Prime numbers of measurement.at n=18A002049
- Palindromes in base 10.at n=46A002113
- Number of compositions of n into a sum of odd primes.at n=29A002124
- Number of partitions of n with exactly two part sizes.at n=47A002133
- Pythagorean primes: primes of the form 4*k + 1.at n=34A002144
- Numbers k for which the rank of the elliptic curve y^2 = x^3 + k is 2.at n=56A002155
- 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=35A002313
- Palindromic primes: prime numbers whose decimal expansion is a palindrome.at n=12A002385
- Primes of the form 6m + 1.at n=34A002476