139
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 140
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 138
- Möbius Function
- -1
- Radical
- 139
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 41
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 34
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- einshundertneununddreißig· ordinal: einshundertneununddreißigste
- English
- one hundred thirty-nine· ordinal: one hundred thirty-ninth
- Spanish
- ciento treinta y nueve· ordinal: 139º
- French
- cent trente-neuf· ordinal: cent trente-neufième
- Italian
- centotrentanove· ordinal: 139º
- Latin
- centum triginta novem· ordinal: 139.
- Portuguese
- cento e trinta e nove· ordinal: 139º
Appears in sequences
- Numbers k such that (2k)^4 + 1 is prime.at n=40A000059
- a(n) = Sum_{k=0..n} p(k) where p(k) = number of partitions of k (A000041).at n=10A000070
- Number of positive integers <= 2^n of form 2*x^2 + 3*y^2.at n=9A000075
- Number of asymmetric trees with n nodes (also called identity trees).at n=13A000220
- a(0)=2; for n>=1, a(n) = smallest prime p such that there is a gap of exactly 2n between p and next prime, or -1 if no such prime exists.at n=5A000230
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=54A000277
- Topswops (1): start by shuffling n cards labeled 1..n. If top card is m, reverse order of top m cards, then repeat. a(n) is the maximal number of steps before top card is 1.at n=15A000375
- Numbers that are the sum of 3 but no fewer nonzero squares.at n=59A000419
- Primes and squares of primes.at n=38A000430
- n-th superior highly composite number A002201(n) is product of first n terms of this sequence.at n=52A000705
- EULER transform of 3, 2, 2, 2, 2, 2, 2, 2, ...at n=6A000713
- Numbers ending with a vowel in American English.at n=62A000861
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=1A000923
- Dimension of the n-th graded piece of the mod-2 Steenrod algebra A_2.at n=49A000929
- Euclid-Mullin sequence: a(1) = 2, a(n+1) is smallest prime factor of 1 + Product_{k=1..n} a(k).at n=9A000945
- Euclid-Mullin sequence: a(1) = 2, a(n+1) is the largest prime factor of 1 + Product_{k=1..n} a(k).at n=4A000946
- Powers of primes. Alternatively, 1 and the prime powers (p^k, p prime, k >= 1).at n=47A000961
- Numbers m such that Sum_{k=0..m-1} exp(2*Pi*i*k^3/m) != 0.at n=39A001074
- Union of all numbers {p, q} where p and q are both primes or powers of primes and q = p+2.at n=34A001092
- Twin primes.at n=20A001097