40
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 4
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 90
- Proper Divisor Sum (Aliquot Sum)
- 50
- 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
- 16
- Möbius Function
- 0
- Radical
- 10
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 8
- Smith Number
- no
Classification
- Natural
- yes
- Even
- yes
- Odd
- 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
- yes
- Carmichael Number
- no
Names
- German
- vierzig· ordinal: vierzigste
- English
- forty· ordinal: fortieth
- Spanish
- cuarenta· ordinal: 40º
- French
- quarante· ordinal: quarantième
- Italian
- quaranta· ordinal: 40º
- Latin
- quadraginta· ordinal: 40.
- Portuguese
- quarenta· ordinal: 40º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=20A000008
- Euler totient function phi(n): count numbers <= n and prime to n.at n=40A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=54A000010
- Number of primitive permutation groups of degree n.at n=48A000019
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=39A000027
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=18A000028
- Coefficients of ménage hit polynomials.at n=4A000033
- Numbers that are not squares (or, the nonsquares).at n=33A000037
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=33A000052
- Numbers k such that (2k)^4 + 1 is prime.at n=13A000059
- Generalized tangent numbers d(n,1).at n=20A000061
- Generalized tangent numbers d(n,1).at n=22A000061
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=28A000062
- Number of ways of writing n as a sum of 5 squares.at n=2A000132
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=12A000134
- Number of ways of placing n nonattacking queens on an n X n board.at n=7A000170
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=24A000201
- a(8i+j) = 13i + a(j), where 1<=j<=8.at n=24A000202
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=26A000203
- a(n) = floor(n^2/3).at n=11A000212