305
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 372
- Proper Divisor Sum (Aliquot Sum)
- 67
- 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
- 240
- Möbius Function
- 1
- Radical
- 305
- 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
- 37
- 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
- dreihundertfünf· ordinal: dreihundertfünfste
- English
- three hundred five· ordinal: three hundred fifth
- Spanish
- trescientos cinco· ordinal: 305º
- French
- trois cent cinq· ordinal: trois cent cinqième
- Italian
- trecentocinque· ordinal: 305º
- Latin
- trecenti quinque· ordinal: 305.
- Portuguese
- trezentos e cinco· ordinal: 305º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=48A000008
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); A000092 gives values of n where |P(n)| sets a new record; sequence gives (nearest integer to, I believe) P(A000092(n)).at n=20A000223
- Genus of complete graph on n nodes.at n=63A000933
- Denominators of continued fraction convergents to sqrt(5).at n=5A001076
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 50, 100 cents.at n=48A001312
- Nearest integer to 2*n*log(n).at n=41A001618
- Primes multiplied by 5.at n=17A001750
- Numbers k such that 19*2^k - 1 is prime.at n=12A001775
- a(n) = A000364(n) * (3^(2*n+1) + 1)/4.at n=2A002437
- Earliest sequence with a(a(n))=5n.at n=62A002518
- Problimes (second definition).at n=54A003067
- Numbers that are the sum of 5 positive 4th powers.at n=19A003339
- Number of minimal 3-covers of a labeled n-set.at n=2A003468
- a(n) is smallest number which is uniquely a(j)+a(k).at n=54A003670
- The coding-theoretic function A(n,6,4).at n=57A004037
- Number of trees with n nodes and 2-colored internal (non-leaf) nodes.at n=8A004114
- Expansion of (1 + x - x^5) / (1 - x)^3.at n=20A004120
- a(0) = 1, a(n) = sum of digits of all previous terms.at n=34A004207
- "Magic" integers: a(n+1) is the smallest integer m such that there is no overlap between the sets {m, m-a(i), m+a(i): 1 <= i <= n} and {a(i), a(i)-a(j), a(i)+a(j): 1 <= j < i <= n}.at n=12A004210
- a(n) = ceiling(100*log(n)).at n=20A004239