327
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 440
- Proper Divisor Sum (Aliquot Sum)
- 113
- 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
- 216
- Möbius Function
- 1
- Radical
- 327
- 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
- 143
- 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
- dreihundertsiebenundzwanzig· ordinal: dreihundertsiebenundzwanzigste
- English
- three hundred twenty-seven· ordinal: three hundred twenty-seventh
- Spanish
- trescientos veintisiete· ordinal: 327º
- French
- trois cent vingt-sept· ordinal: trois cent vingt-septième
- Italian
- trecentoventisette· ordinal: 327º
- Latin
- trecenti viginti septem· ordinal: 327.
- Portuguese
- trezentos e vinte e sete· ordinal: 327º
Appears in sequences
- Ramanujan's approximation to population of x^2 + y^2 <= 2^n.at n=10A000691
- Numbers k such that 3^k, 3^(k+1) and 3^(k+2) have the same number of digits.at n=15A001682
- a(n) = 3 * prime(n).at n=28A001748
- Numbers k for which the rank of the elliptic curve y^2 = x^3 - k is 2.at n=42A002154
- Numbers k such that 45*2^k - 1 is prime.at n=28A002242
- a(n) = A000201(A003234(n)) + n.at n=47A003248
- Numbers that are the sum of 7 positive 4th powers.at n=27A003341
- Numbers that are the sum of 12 positive 4th powers.at n=41A003346
- Numbers that are the sum of 12 positive 6th powers.at n=5A003368
- Number of solid partitions of n supported on graph of cube.at n=11A003404
- Divisors of 2^36 - 1.at n=36A003543
- Number of 2-factors in O_5 X P_n.at n=1A003742
- Numbers that are the sum of 4 but no fewer nonzero squares.at n=52A004215
- a(n) = 8*n + 7. Or, numbers whose binary expansion ends in 111.at n=40A004771
- a(1)=1, a(2)=3; a(n) is least k such that no three terms of a(1), a(2), ..., a(n-1), k form an arithmetic progression.at n=49A004793
- a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=1, a(2)=3.at n=18A004979
- Number of unlabeled reduced unit interval graphs on n nodes.at n=10A005218
- Minimal number of moves for the cyclic variant of the Towers of Hanoi for 3 pegs and n disks, with the final peg one step away.at n=6A005665
- a(n) = 2^(n-1) + 2^[ n/2 ] + 2^[ (n-1)/2 ] - F(n+3).at n=10A005674
- Numbers whose base-3 representation contains no 2.at n=50A005836