854
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1488
- Proper Divisor Sum (Aliquot Sum)
- 634
- 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
- 360
- Möbius Function
- -1
- Radical
- 854
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 54
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Names
- German
- achthundertvierundfünfzig· ordinal: achthundertvierundfünfzigste
- English
- eight hundred fifty-four· ordinal: eight hundred fifty-fourth
- Spanish
- ochocientos cincuenta y cuatro· ordinal: 854º
- French
- huit cent cinquante-quatre· ordinal: huit cent cinquante-quatrième
- Italian
- ottocentocinquantaquattro· ordinal: 854º
- Latin
- octingenti quinquaginta quattuor· ordinal: 854.
- Portuguese
- oitocentos e cinquenta e quatro· ordinal: 854º
Appears in sequences
- A Fielder sequence: a(n) = a(n-1) + a(n-2) + a(n-4).at n=11A001641
- Related to Zarankiewicz's problem.at n=39A001841
- Generalized sum of divisors function.at n=27A002130
- Numbers k such that (k^2 + k + 1)/13 is prime.at n=41A002642
- Number of unlabeled planar trees (also called plane trees) with n nodes.at n=11A002995
- Numbers that are the sum of 2 positive cubes.at n=38A003325
- Numbers that are a sum of distinct positive cubes in more than one way.at n=20A003998
- Sums of two nonnegative cubes.at n=48A004999
- a(n) = a(n-1) + (-1)^(n-1) * a(n-2)^2 for n >= 2 with a(0) = 0 and a(1) = 1.at n=9A005605
- Number of integer partitions of n whose smallest part is equal to the number of parts.at n=57A006141
- Number of polynomials of degree n over GF(2) in which the degrees of all irreducible factors are distinct.at n=11A007839
- Coordination sequence T1 for Zeolite Code EMT.at n=24A008086
- Coordination sequence T4 for Zeolite Code HEU.at n=19A008119
- Coordination sequence T5 for Zeolite Code MEL.at n=19A008154
- If a, b in sequence, so is ab+10.at n=10A009368
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=28A011905
- Pisot sequence E(8,14), a(n)=[ a(n-1)^2/a(n-2)+1/2 ].at n=8A014002
- Floor((e/2)^n).at n=22A014213
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=1.at n=11A014563
- Numbers k such that phi(k) + 12 | sigma(k).at n=27A015805