300
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 3
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 868
- Proper Divisor Sum (Aliquot Sum)
- 568
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 80
- Möbius Function
- 0
- Radical
- 30
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- yes
- 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
- 16
- 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
- yes
- Odd
- no
Names
- German
- dreihundert· ordinal: dreihundertste
- English
- three hundred· ordinal: three hundredth
- Spanish
- trescientos· ordinal: 300º
- French
- trois cents· ordinal: trois centsième
- Italian
- trecento· ordinal: 300º
- Latin
- trecenti· ordinal: 300.
- Portuguese
- trezentos· ordinal: 300º
Appears in sequences
- Number of cusps of principal congruence subgroup Gamma^{hat}(n).at n=23A000114
- a(n) = floor(n^2/3).at n=30A000212
- Number of labeled rooted trees of height 3 with n nodes.at n=1A000552
- Generating function = Product_{m>=1} 1/(1 - x^m)^2; a(n) = number of partitions of n into parts of 2 kinds.at n=9A000712
- Numbers that are the sum of 2 successive primes.at n=34A001043
- Dimensions (sorted, with duplicates removed) of real simple Lie algebras.at n=60A001066
- Numbers k such that k / (sum of digits of k) is a square.at n=21A001102
- Smallest even number that is an unordered sum of two odd primes in exactly n ways.at n=21A001172
- Pisano periods (or Pisano numbers): period of Fibonacci numbers mod n.at n=49A001175
- a(1)=0, a(2n) = a(n)+1, a(2n+1) = 10*a(n+1).at n=28A001202
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25 cents.at n=45A001301
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25, 50 cents.at n=45A001302
- 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=57A001399
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^6 in powers of x.at n=40A001484
- a(n) = (7*n+1)*(7*n+6).at n=2A001526
- Winning moves in Fibonacci nim.at n=53A001581
- Lah numbers: a(n) = n! * binomial(n-1, 3)/4!.at n=2A001755
- Number of quasi-alternating permutations of length n.at n=4A001758
- Related to Zarankiewicz's problem.at n=22A001841
- Expansion of 1/(1 - 3*x + x^2)^2.at n=4A001871