20
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 2
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 42
- Proper Divisor Sum (Aliquot Sum)
- 22
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 8
- Möbius Function
- 0
- Radical
- 10
- 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
- yes
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- yes
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 7
- 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
- zwanzig· ordinal: zwanzigste
- English
- twenty· ordinal: twentieth
- Spanish
- veinte· ordinal: vigésimo
- French
- vingt· ordinal: vingtième
- Italian
- venti· ordinal: 20º
- Latin
- viginti· ordinal: 20.
- Portuguese
- vinte· ordinal: 20º
Appears in sequences
- Euler totient function phi(n): count numbers <= n and prime to n.at n=24A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=32A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=43A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=49A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=65A000010
- Definition (1): Number of n-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed.at n=8A000013
- Number of centered hydrocarbons with n atoms.at n=9A000022
- Number of positive integers <= 2^n of form x^2 + 10 y^2.at n=6A000024
- Coefficients of the 3rd-order mock theta function f(q).at n=15A000025
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=19A000026
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=49A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=19A000027
- Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n.at n=7A000031
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives closest integer to P(A000099(n)).at n=18A000036
- Numbers that are not squares (or, the nonsquares).at n=15A000037
- Generalized tangent numbers d(n,1).at n=12A000061
- Generalized tangent numbers d(n,1).at n=13A000061
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=14A000062
- Numbers k such that k^4 + 1 is prime.at n=5A000068
- a(n) = Fibonacci(n) - 1.at n=7A000071