264
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 720
- Proper Divisor Sum (Aliquot Sum)
- 456
- 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
- 66
- 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
- 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
- 29
- 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
- zweihundertvierundsechzig· ordinal: zweihundertvierundsechzigste
- English
- two hundred sixty-four· ordinal: two hundred sixty-fourth
- Spanish
- doscientos sesenta y cuatro· ordinal: 264º
- French
- deux cent soixante-quatre· ordinal: deux cent soixante-quatrième
- Italian
- duecentosessantaquattro· ordinal: 264º
- Latin
- ducenti sexaginta quattuor· ordinal: 264.
- Portuguese
- duzentos e sessenta e quatro· ordinal: 264º
Appears in sequences
- Number of cusps of principal congruence subgroup Gamma^{hat}(n).at n=21A000114
- Number of ways of writing n as a sum of 12 squares.at n=2A000145
- Rencontres numbers: number of permutations of [n] with exactly one fixed point.at n=5A000240
- a(n) = (n+1)*(n+3)*(n+8)/6.at n=9A000297
- a(n+3) = a(n+2) + a(n+1) + a(n) - 4.at n=10A000803
- Number of n-input 2-output switching networks under action of GL(n,2) on the inputs and complementing group C(2,2) on the outputs.at n=2A000847
- Dimension of the n-th graded piece of the mod-2 Steenrod algebra A_2.at n=62A000929
- Numbers that are divisible by at least three different primes.at n=46A000977
- Number of n-step polygons on f.c.c. lattice.at n=3A001337
- Number of 2n-step self-avoiding cycles on the cubic lattice.at n=2A001413
- a(n) = (2^n + 2^[ n/2 ] )/2.at n=7A001445
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^6 in powers of x.at n=19A001484
- Winning moves in Fibonacci nim.at n=46A001581
- v-pile counts for the 4-Wythoff game with i=2.at n=50A001966
- Expansion of 1/((1-x)^2*(1-x^4)) = 1/( (1+x)*(1+x^2)*(1-x)^3 ).at n=43A001972
- Prime numbers of measurement.at n=15A002049
- Numbers congruent to {2, 4, 8, 16} (mod 20).at n=53A002081
- 2nd differences are periodic.at n=12A002082
- a(1) = 3; for n > 1, a(n) = 4*phi(n); given a rational number r = p/q, where q>0, (p,q)=1, define its height to be max{|p|,q}; then a(n) = number of rational numbers of height n.at n=66A002246
- Degree of rational Poncelet porism of n-gon.at n=43A002348