200 (number)

← 199 200 201 →
← 200 201 202 203 204 205 206 207 208 209 → List of numbers; Integers; ← 0 100 200 300 400 500 600 700 800 900 →
Cardinal	two hundred
Ordinal	200th; (two hundredth)
Factorization	23 × 52
Divisors	1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 2000
Greek numeral	Σ´
Roman numeral	CC
Binary	110010002
Ternary	211023
Senary	5326
Octal	3108
Duodecimal	14812
Hexadecimal	C816
Armenian	Մ
Hebrew	ר
Babylonian cuneiform	𒐗⟪
Egyptian hieroglyph	𓍣

200 (two hundred) is the natural number following 199 and preceding 201.

In mathematics

200 is an abundant number, as 265, the sum of its proper divisors, is greater than itself.

The number appears in the Padovan sequence, preceded by 86, 114, 151 (it is the sum of the first two of these).^[1]

The sum of Euler's totient function φ(x) over the first twenty-five integers is 200.

200 is the smallest base 10 unprimeable number – it cannot be turned into a prime number by changing just one of its digits to any other digit. It is also a Harshad number.

200 is an Achilles number.^[2]

In science

200 MeV is the temperature of quark–gluon plasma phase transition.

References

^ "Sloane's A000931 : Padovan sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-28.
^ Sloane, N. J. A. (ed.). "Sequence A052486 (Achilles numbers - powerful but imperfect: if n = Product(p_i^e_i) then all e_i > 1 (i.e., powerful), but the highest common factor of the e_i is 1, i.e., not a perfect power)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[1] "Sloane's A000931 : Padovan sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-28.

[2] Sloane, N. J. A. (ed.). "Sequence A052486 (Achilles numbers - powerful but imperfect: if n = Product(p_i^e_i) then all e_i > 1 (i.e., powerful), but the highest common factor of the e_i is 1, i.e., not a perfect power)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[1]

[2]