447
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 600
- Proper Divisor Sum (Aliquot Sum)
- 153
- 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
- 296
- Möbius Function
- 1
- Radical
- 447
- 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
- 97
- 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
- vierhundertsiebenundvierzig· ordinal: vierhundertsiebenundvierzigste
- English
- four hundred forty-seven· ordinal: four hundred forty-seventh
- Spanish
- cuatrocientos cuarenta y siete· ordinal: 447º
- French
- quatre cent quarante-sept· ordinal: quatre cent quarante-septième
- Italian
- quattrocentoquarantasette· ordinal: 447º
- Latin
- quadringenti quadraginta septem· ordinal: 447.
- Portuguese
- quatrocentos e quarenta e sete· ordinal: 447º
Appears in sequences
- Numbers that are not the sum of 4 tetrahedral numbers.at n=30A000797
- a(n) = n*(n-1)*a(n-1)/2 + a(n-2), a(0) = a(1) = 1.at n=5A001046
- a(n) = 3 * prime(n).at n=34A001748
- G.f.: (1 + x^4 + x^7 + 2*x^8 + x^9 + x^12 + x^16)/Product_{i=1..8} (1 - x^i).at n=17A003405
- Number of unlabeled unit interval graphs with n nodes.at n=7A005217
- Numbers k such that 10*3^k - 1 is prime.at n=29A005542
- Minimal number of moves for the cyclic variant of the Towers of Hanoi for 3 pegs and n disks, with the final peg two steps away.at n=6A005666
- Coefficients of the '2nd-order' mock theta function A(q).at n=19A006304
- In the '3x+1' problem, these values for the starting value set new records for highest point of trajectory before reaching 1.at n=7A006884
- Tower of Hanoi with 5 pegs.at n=37A007665
- Coordination sequence T2 for Zeolite Code AWW.at n=15A008046
- Coordination sequence T2 for Zeolite Code BOG.at n=15A008050
- Coordination sequence T5 for Zeolite Code BOG.at n=15A008053
- Coordination sequence T1 for Zeolite Code DOH.at n=13A008078
- Coordination sequence T2 for Zeolite Code MFS.at n=13A008174
- Coordination sequence T2 for Zeolite Code MTW.at n=14A008197
- Expansion of (1+x^7)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=30A008768
- Expansion of e.g.f. log(1+x)/cosh(sinh(x)).at n=7A009432
- Expansion of tan(sin(tanh(x))).at n=3A009660
- Coordination sequence T4 for Zeolite Code -CLO.at n=19A009853