200
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 2
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 465
- Proper Divisor Sum (Aliquot Sum)
- 265
- 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
- 80
- Möbius Function
- 0
- Radical
- 10
- Omega Function (Ω)
- 5
- 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
- 26
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- zweihundert· ordinal: zweihundertste
- English
- two hundred· ordinal: two hundredth
- Spanish
- doscientos· ordinal: 200º
- French
- deux cents· ordinal: deux centsième
- Italian
- duecento· ordinal: 200º
- Latin
- ducenti· ordinal: 200.
- Portuguese
- duzentos· ordinal: 200º
Appears in sequences
- Local stops on New York City A line subway.at n=23A000054
- Number of ways of writing n as a sum of 5 squares.at n=8A000132
- a(n) = (n+1)*(n+3)*(n+8)/6.at n=8A000297
- n written in base where place values are positive cubes.at n=54A000433
- Number of steps to reach 1 in sequence A000546.at n=38A000547
- Number of labeled rooted trees of height 2 with n nodes.at n=2A000551
- A Beatty sequence: [ n(e+1) ].at n=53A000572
- Number of fixed-point-free permutation groups of degree n.at n=8A000637
- a(n) is the number of conjugacy classes in the alternating group A_n.at n=17A000702
- Expansion of bracket function.at n=6A000750
- Padovan sequence (or Padovan numbers): a(n) = a(n-2) + a(n-3) with a(0) = 1, a(1) = a(2) = 0.at n=25A000931
- a(n) = ceiling(n^2/2).at n=20A000982
- Numbers m such that Sum_{k=0..m-1} exp(2*Pi*i*k^3/m) != 0.at n=54A001074
- Numbers k such that k / (sum of digits of k) is a square.at n=18A001102
- a(n) = 2*n^2.at n=10A001105
- Maximal number of pairwise relatively prime polynomials of degree n over GF(2).at n=11A001115
- a(1)=0, a(2n) = a(n)+1, a(2n+1) = 10*a(n+1).at n=12A001202
- a(n) is the number of partitions of n into at most 3 parts; also partitions of n+3 in which the greatest part is 3; also number of unlabeled multigraphs with 3 nodes and n edges.at n=46A001399
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^10 in powers of x.at n=4A001488
- Erroneous version of A000637.at n=8A001493