Base | Representation |
---|---|
bin | 101101011110101011010000… |
… | …010000101100011111101001 |
3 | 222020012201220010212101100112 |
4 | 231132223100100230133221 |
5 | 202204112201434342301 |
6 | 1545223550340344105 |
7 | 60062656030146620 |
oct | 5536532020543751 |
9 | 866181803771315 |
10 | 200020121012201 |
11 | 58807069885656 |
12 | 1a5252a59a5035 |
13 | 877ba7ca56369 |
14 | 375705000a6b7 |
15 | 181ceb07609bb |
hex | b5ead042c7e9 |
200020121012201 has 4 divisors (see below), whose sum is σ = 228594424013952. Its totient is φ = 171445818010452.
The previous prime is 200020121012141. The next prime is 200020121012249. The reversal of 200020121012201 is 102210121020002.
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 200020121012201 - 210 = 200020121011177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200020121012251) 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, 14287151500865 + ... + 14287151500878.
It is an arithmetic number, because the mean of its divisors is an integer number (57148606003488).
Almost surely, 2200020121012201 is an apocalyptic number.
It is an amenable number.
200020121012201 is a deficient number, since it is larger than the sum of its proper divisors (28574303001751).
200020121012201 is an equidigital number, since it uses as much as digits as its factorization.
200020121012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28574303001750.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 200020121012201 its reverse (102210121020002), we get a palindrome (302230242032203).
The spelling of 200020121012201 in words is "two hundred trillion, twenty billion, one hundred twenty-one million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •