940
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 2016
- Proper Divisor Sum (Aliquot Sum)
- 1076
- 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
- 368
- Möbius Function
- 0
- Radical
- 470
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 129
- 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
- neunhundertvierzig· ordinal: neunhundertvierzigste
- English
- nine hundred forty· ordinal: nine hundred fortieth
- Spanish
- novecientos cuarenta· ordinal: 940º
- French
- neuf cent quarante· ordinal: neuf cent quarantième
- Italian
- novecentoquaranta· ordinal: 940º
- Latin
- nongenti quadraginta· ordinal: 940.
- Portuguese
- novecentos e quarenta· ordinal: 940º
Appears in sequences
- Convolution inverse of A143348.at n=8A002039
- Sum of totient function: a(n) = Sum_{k=1..n} phi(k), cf. A000010.at n=55A002088
- Number of "cubic partitions" of n: expansion of Product_{k>0} 1/((1-x^(2k))^2*(1-x^(2k-1))) in powers of x.at n=16A002513
- Erroneous version of A173380.at n=7A002932
- a(n) = round(n*phi^8), where phi is the golden ratio, A001622.at n=20A004943
- a(n) = ceiling(n*phi^8), where phi is the golden ratio, A001622.at n=20A004963
- Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (0,2,2).at n=3A005543
- Number of integer partitions of n whose smallest part is equal to the number of parts.at n=58A006141
- Discriminants of totally real cubic fields.at n=23A006832
- Coordination sequence T2 for Zeolite Code EUO.at n=19A008097
- Coordination sequence T3 for Zeolite Code GOO.at n=21A008113
- Multiples of 20.at n=47A008602
- Molien series of 5 X 5 upper triangular matrices over GF( 2 ).at n=55A008644
- Molien series of 5 X 5 upper triangular matrices over GF( 2 ).at n=54A008644
- Coordination sequence for FeS2-Marcasite, Fe position.at n=15A009955
- Coordination sequence for FeS2-Marcasite, Fe position.at n=16A009955
- Expansion of e.g.f. tan(arctanh(x) + log(x+1)).at n=5A013158
- Numbers k such that phi(k) | sigma_11(k).at n=41A015769
- Numbers k such that phi(k) + 4 | sigma(k + 4).at n=40A015783
- Let m=n+1; a(n) is the least positive integer s, not a multiple of m, such that if 1<=d<=m and (d,m)=1, then d divides one of the numbers s-m, s-2m, ..., s-m[ s/m ].at n=39A018205