Base | Representation |
---|---|
bin | 101101011110101011001001… |
… | …101010000001101101101001 |
3 | 222020012201121102101011022211 |
4 | 231132223021222001231221 |
5 | 202204111440103242301 |
6 | 1545223531341445121 |
7 | 60062653213313554 |
oct | 5536531152015551 |
9 | 866181542334284 |
10 | 200020010212201 |
11 | 58807012287a03 |
12 | 1a5252748707a1 |
13 | 877ba62b00b2a |
14 | 375703d40769b |
15 | 181cea5b76051 |
hex | b5eac9a81b69 |
200020010212201 has 4 divisors (see below), whose sum is σ = 200054454855552. Its totient is φ = 199985565568852.
The previous prime is 200020010212193. The next prime is 200020010212219. The reversal of 200020010212201 is 102212010020002.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 200020010212201 - 23 = 200020010212193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200020010212801) 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, 17222312965 + ... + 17222324578.
It is an arithmetic number, because the mean of its divisors is an integer number (50013613713888).
Almost surely, 2200020010212201 is an apocalyptic number.
It is an amenable number.
200020010212201 is a deficient number, since it is larger than the sum of its proper divisors (34444643351).
200020010212201 is an equidigital number, since it uses as much as digits as its factorization.
200020010212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34444643350.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200020010212201 its reverse (102212010020002), we get a palindrome (302232020232203).
The spelling of 200020010212201 in words is "two hundred trillion, twenty billion, ten million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •