Base | Representation |
---|---|
bin | 101101011110100011111000… |
… | …001101000011000101101011 |
3 | 222020011222110012100202110012 |
4 | 231132203320031003011223 |
5 | 202203444442002211334 |
6 | 1545220200423442135 |
7 | 60062255542016126 |
oct | 5536437015030553 |
9 | 866158405322405 |
10 | 200012201210219 |
11 | 58803775304162 |
12 | 1a5238555b634b |
13 | 877b0ba0127b8 |
14 | 37568dc25b3bd |
15 | 181cb9a3079ce |
hex | b5e8f834316b |
200012201210219 has 4 divisors (see below), whose sum is σ = 200022407496144. Its totient is φ = 200001994924296.
The previous prime is 200012201210197. The next prime is 200012201210233. The reversal of 200012201210219 is 912012102210002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200012201210219 - 240 = 198912689582443 is a prime.
It is a super-2 number, since 2×2000122012102192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200012201210194 and 200012201210203.
It is not an unprimeable number, because it can be changed into a prime (200012101210219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5103113567 + ... + 5103152760.
It is an arithmetic number, because the mean of its divisors is an integer number (50005601874036).
Almost surely, 2200012201210219 is an apocalyptic number.
200012201210219 is a deficient number, since it is larger than the sum of its proper divisors (10206285925).
200012201210219 is a wasteful number, since it uses less digits than its factorization.
200012201210219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10206285924.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 200012201210219 in words is "two hundred trillion, twelve billion, two hundred one million, two hundred ten thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •