140
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 336
- Proper Divisor Sum (Aliquot Sum)
- 196
- 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
- 48
- Möbius Function
- 0
- Radical
- 70
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 15
- 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
- einshundertvierzig· ordinal: einshundertvierzigste
- English
- one hundred forty· ordinal: one hundred fortieth
- Spanish
- ciento cuarenta· ordinal: 140º
- French
- cent quarante· ordinal: cent quarantième
- Italian
- centoquaranta· ordinal: 140º
- Latin
- centum quadraginta· ordinal: 140.
- Portuguese
- cento e quarenta· ordinal: 140º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=35A000008
- Generalized tangent numbers d(n,1).at n=52A000061
- Numbers k such that k^4 + 1 is prime.at n=21A000068
- Number of positive integers <= 2^n of form x^2 + 6 y^2.at n=9A000077
- a(n) = floor(n^(3/2)).at n=27A000093
- Denumerants: Expansion of 1/((1-x)*(1-x^2)*(1-x^5)).at n=49A000115
- Number of binary partitions: number of partitions of 2n into powers of 2.at n=14A000123
- Coefficients of ménage hit polynomials.at n=2A000185
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=55A000277
- a(n) = number of solid (i.e., three-dimensional) partitions of n.at n=6A000293
- Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=7A000330
- Numbers that are the sum of 3 but no fewer nonzero squares.at n=60A000419
- Stirling numbers of the second kind, S(n,5).at n=2A000481
- Number of partitions of n into prime parts.at n=33A000607
- Expansion of Product_{n>=1} (1 - x^n)^7.at n=17A000730
- Total number of 1's in binary expansions of 0, ..., n.at n=51A000788
- Landau's function g(n): largest order of permutation of n elements. Equivalently, largest LCM of partitions of n.at n=16A000793
- a(n) = 5*binomial(n, 6).at n=8A000910
- Numbers that are divisible by at least three different primes.at n=17A000977
- Pisano periods (or Pisano numbers): period of Fibonacci numbers mod n.at n=64A001175