Base | Representation |
---|---|
bin | 1011101001011100000… |
… | …1010100101101011001 |
3 | 201010111110121002120010 |
4 | 2322113001110231121 |
5 | 11234302130432301 |
6 | 231531540352133 |
7 | 20312501440416 |
oct | 2722701245531 |
9 | 633443532503 |
10 | 200102202201 |
11 | 77954527230 |
12 | 329459a5649 |
13 | 15b3c554155 |
14 | 99838c710d |
15 | 53124115d6 |
hex | 2e97054b59 |
200102202201 has 8 divisors (see below), whose sum is σ = 291057748704. Its totient is φ = 121274061920.
The previous prime is 200102202193. The next prime is 200102202233. The reversal of 200102202201 is 102202201002.
200102202201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200102202201 - 23 = 200102202193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200102202401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3031851516 + ... + 3031851581.
It is an arithmetic number, because the mean of its divisors is an integer number (36382218588).
Almost surely, 2200102202201 is an apocalyptic number.
It is an amenable number.
200102202201 is a deficient number, since it is larger than the sum of its proper divisors (90955546503).
200102202201 is a wasteful number, since it uses less digits than its factorization.
200102202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6063703111.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 200102202201 its reverse (102202201002), we get a palindrome (302304403203).
The spelling of 200102202201 in words is "two hundred billion, one hundred two million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •