199
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 200
- 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
- 198
- Möbius Function
- -1
- Radical
- 199
- 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
- yes
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 119
- 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
- 46
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- einshundertneunundneunzig· ordinal: einshundertneunundneunzigste
- English
- one hundred ninety-nine· ordinal: one hundred ninety-ninth
- Spanish
- ciento noventa y nueve· ordinal: 199º
- French
- cent quatre-vingt-dix-neuf· ordinal: cent quatre-vingt-dix-neufième
- Italian
- centonovantanove· ordinal: 199º
- Latin
- centum nonaginta novem· ordinal: 199.
- Portuguese
- cento e noventa e nove· ordinal: 199º
Appears in sequences
- Lucas numbers (beginning with 1): L(n) = L(n-1) + L(n-2) with L(1) = 1, L(2) = 3.at n=10A000204
- 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=6A000230
- Primes and squares of primes.at n=51A000430
- Number of steps to reach 1 in sequence A000546.at n=50A000547
- Number of nonnegative solutions to x^2 + y^2 + z^2 <= n.at n=41A000606
- Number of n-node steric rooted ternary trees; number of n carbon alkyl radicals C(n)H(2n+1) taking stereoisomers into account.at n=8A000625
- n-th superior highly composite number A002201(n) is product of first n terms of this sequence.at n=68A000705
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=3A000923
- Powers of primes. Alternatively, 1 and the prime powers (p^k, p prime, k >= 1).at n=60A000961
- Wagstaff numbers: numbers k such that (2^k + 1)/3 is prime.at n=16A000978
- Numbers m such that Sum_{k=0..m-1} exp(2*Pi*i*k^3/m) != 0.at n=53A001074
- a(n) = 20*a(n-1) - a(n-2).at n=2A001085
- Union of all numbers {p, q} where p and q are both primes or powers of primes and q = p+2.at n=44A001092
- Twin primes.at n=28A001097
- Primes with 3 as smallest primitive root.at n=9A001123
- Primes == +-1 (mod 8).at n=19A001132
- Smallest prime p such that the product of q/(q-1) over the primes from prime(n) to p is greater than 2.at n=5A001275
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25 cents.at n=39A001301
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25, 50 cents.at n=39A001302
- Associated Mersenne numbers.at n=11A001350