847
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 1064
- Proper Divisor Sum (Aliquot Sum)
- 217
- 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
- 660
- Möbius Function
- 0
- Radical
- 77
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 33
- 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
- no
- Odd
- yes
Names
- German
- achthundertsiebenundvierzig· ordinal: achthundertsiebenundvierzigste
- English
- eight hundred forty-seven· ordinal: eight hundred forty-seventh
- Spanish
- ochocientos cuarenta y siete· ordinal: 847º
- French
- huit cent quarante-sept· ordinal: huit cent quarante-septième
- Italian
- ottocentoquarantasette· ordinal: 847º
- Latin
- octingenti quadraginta septem· ordinal: 847.
- Portuguese
- oitocentos e quarenta e sete· ordinal: 847º
Appears in sequences
- Number of nonnegative solutions to x^2 + y^2 + z^2 <= n^2.at n=11A000604
- a(n) = n + n*(n-1)*(n-2)*(n-3).at n=7A001094
- Number of n-node trees of height at most 4.at n=11A001384
- a(n) = 2*a(n-1) + 5*a(n-2), with a(0) = a(1) = 1.at n=6A002533
- Number of 3 X 3 X 3 arrays M_ijk (1 <= i,j,k <= 3) with entries satisfying 0 <= M_ijk <= n and all line sums equal to n.at n=3A002721
- Number of partitions of n that do not contain 1 as a part.at n=29A002865
- Numbers of the form 7^i*11^j.at n=8A003599
- Non-Hamiltonian 1-tough simplicial polyhedra with n nodes.at n=15A007031
- Number of sum-free subsets of {1, ..., n}.at n=14A007865
- Coordination sequence T1 for Zeolite Code AEI.at n=22A008001
- Coordination sequence T3 for Zeolite Code DAC.at n=18A008069
- Coordination sequence T3 for Zeolite Code DOH.at n=18A008080
- Expansion of 1/((1-x)*(1-x^3)*(1-x^5)*(1-x^7)*(1-x^9)).at n=54A008674
- Coordination sequence T4 for Zeolite Code -PAR.at n=21A009858
- Coordination sequence T2 for Zeolite Code -WEN.at n=21A009863
- Coordination sequence T2 for Zeolite Code AFX.at n=22A009865
- a(0) = 1, a(n) = 5*n^2 + 2 for n>0.at n=13A010001
- Composite numbers that are equal to the sum of the first k composites for some k.at n=27A013921
- q-Catalan numbers (binomial version) for q=3.at n=3A015033
- a(n) = (2*n - 15)*n^2.at n=11A015247