Base | Representation |
---|---|
bin | 1011101001011011100… |
… | …1101100011000010001 |
3 | 201010111022211110210122 |
4 | 2322112321230120101 |
5 | 11234301122431001 |
6 | 231531425440025 |
7 | 20312445440060 |
oct | 2722671543021 |
9 | 633438743718 |
10 | 200100202001 |
11 | 77953390477 |
12 | 329451a0015 |
13 | 15b3c0038bb |
14 | 99835261d7 |
15 | 5312168b1b |
hex | 2e96e6c611 |
200100202001 has 16 divisors (see below), whose sum is σ = 240736204800. Its totient is φ = 162477826128.
The previous prime is 200100201997. The next prime is 200100202013. The reversal of 200100202001 is 100202001002.
200100202001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 200100202001 - 22 = 200100201997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200100202001.
It is not an unprimeable number, because it can be changed into a prime (200100202031) 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 15 ways as a sum of consecutive naturals, for example, 3021320 + ... + 3086838.
It is an arithmetic number, because the mean of its divisors is an integer number (15046012800).
Almost surely, 2200100202001 is an apocalyptic number.
It is an amenable number.
200100202001 is a deficient number, since it is larger than the sum of its proper divisors (40636002799).
200100202001 is a wasteful number, since it uses less digits than its factorization.
200100202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88508.
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 200100202001 its reverse (100202001002), we get a palindrome (300302203003).
The spelling of 200100202001 in words is "two hundred billion, one hundred million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •