375
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 624
- Proper Divisor Sum (Aliquot Sum)
- 249
- 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
- 200
- Möbius Function
- 0
- Radical
- 15
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 45
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- dreihundertfünfundsiebzig· ordinal: dreihundertfünfundsiebzigste
- English
- three hundred seventy-five· ordinal: three hundred seventy-fifth
- Spanish
- trescientos setenta y cinco· ordinal: 375º
- French
- trois cent soixante-quinze· ordinal: trois cent soixante-quinzième
- Italian
- trecentosettantacinque· ordinal: 375º
- Latin
- trecenti septuaginta quinque· ordinal: 375.
- Portuguese
- trezentos e setenta e cinco· ordinal: 375º
Appears in sequences
- Dying rabbits: a(0) = 1; for 1 <= n <= 12, a(n) = Fibonacci(n); for n >= 13, a(n) = a(n-1) + a(n-2) - a(n-13).at n=14A000044
- Expansion of x^3*(5-2*x)*(1-x^3)/(1-x)^4.at n=8A000338
- Numbers k such that k / (sum of digits of k) is a square.at n=24A001102
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^6 in powers of x.at n=22A001484
- Genus of modular group Gamma(n) = genus of modular curve Chi(n).at n=21A001767
- a(n) = Fibonacci(n+3) - 2.at n=11A001911
- Numbers k such that 39*2^k + 1 is prime.at n=20A002269
- Numbers k such that (k^2 + k + 1)/7 is prime.at n=36A002641
- Numbers k such that (k^2 + 1)/2 is prime.at n=57A002731
- a(n) = a(n-1) + a(n-2) - a(n-3).at n=14A002798
- a(n) = nearest integer to n^(3/2).at n=52A002821
- Numbers that are the sum of 3 positive cubes.at n=50A003072
- Numbers that are the sum of 10 positive 4th powers.at n=42A003344
- Numbers that are the sum of 9 positive 5th powers.at n=14A003354
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals up to rotation and reflection.at n=17A003453
- Numbers of the form 3^i*5^j with i, j >= 0.at n=14A003593
- Completely multiplicative with a(prime(k)) = prime(k+1).at n=53A003961
- Number of partitions of n into 3 or more parts.at n=17A004250
- a(n) = 8*n + 7. Or, numbers whose binary expansion ends in 111.at n=46A004771
- a(n) = floor(n*phi^8), where phi is the golden ratio, A001622.at n=8A004923