304
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 620
- Proper Divisor Sum (Aliquot Sum)
- 316
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- yes
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 144
- Möbius Function
- 0
- Radical
- 38
- Omega Function (Ω)
- 5
- 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
- 24
- 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
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- dreihundertvier· ordinal: dreihundertvierste
- English
- three hundred four· ordinal: three hundred fourth
- Spanish
- trescientos cuatro· ordinal: 304º
- French
- trois cent quatre· ordinal: trois cent quatrième
- Italian
- trecentoquattro· ordinal: 304º
- Latin
- trecenti quattuor· ordinal: 304.
- Portuguese
- trezentos e quatro· ordinal: 304º
Appears in sequences
- Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.at n=37A000118
- Number of permutations of an n-sequence discordant with three given permutations (see reference) in n-7 places.at n=1A000500
- Shifts 3 places left under binomial transform.at n=11A000996
- a(n) = (5*n+1)*(5*n+4).at n=3A001545
- A Fielder sequence.at n=8A001645
- Numbers k such that 3^k, 3^(k+1) and 3^(k+2) have the same number of digits.at n=14A001682
- Numbers of the form (p^2 - 1)/120 where p is 1 or prime.at n=19A002381
- Squares written in base 8.at n=13A002441
- Numbers k such that 4*k^2 + 9 is prime.at n=56A002970
- a(0) = 1; for n > 0, a(n) = a(n-1) + floor(sqrt(a(n-1))).at n=37A002984
- Problimes (first definition).at n=54A003066
- Sorting numbers: maximal number of comparisons for sorting n elements by list merging.at n=60A003071
- Numbers that are the sum of 4 nonzero 4th powers.at n=16A003338
- Add 4, then reverse digits; start with 0.at n=40A003608
- a(n) = floor(100*log(n)).at n=20A004237
- a(n) = 100*log(n) rounded to nearest integer.at n=20A004238
- Primes written in base 5.at n=21A004679
- Primes written in base 7.at n=35A004681
- Numbers that are the sum of at most 4 nonzero 4th powers.at n=42A004833
- a(n) = floor(n*phi^9), where phi is the golden ratio, A001622.at n=4A004924