Base | Representation |
---|---|
bin | 1011101001011011100… |
… | …1101110010101010001 |
3 | 201010111022211212202221 |
4 | 2322112321232111101 |
5 | 11234301123210001 |
6 | 231531425541041 |
7 | 20312445502306 |
oct | 2722671562521 |
9 | 633438755687 |
10 | 200100210001 |
11 | 7795339648a |
12 | 329451a4781 |
13 | 15b3c007433 |
14 | 99835290ad |
15 | 531216b1a1 |
hex | 2e96e6e551 |
200100210001 has 4 divisors (see below), whose sum is σ = 200120430004. Its totient is φ = 200079990000.
The previous prime is 200100209999. The next prime is 200100210017. The reversal of 200100210001 is 100012001002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 152587109376 + 47513100625 = 390624^2 + 217975^2 .
It is a cyclic number.
It is not a de Polignac number, because 200100210001 - 21 = 200100209999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200100210061) 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, 10095150 + ... + 10114951.
It is an arithmetic number, because the mean of its divisors is an integer number (50030107501).
Almost surely, 2200100210001 is an apocalyptic number.
It is an amenable number.
200100210001 is a deficient number, since it is larger than the sum of its proper divisors (20220003).
200100210001 is an equidigital number, since it uses as much as digits as its factorization.
200100210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20220002.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 200100210001 its reverse (100012001002), we get a palindrome (300112211003).
It can be divided in two parts, 2001002 and 10001, that multiplied together give a palindrome (20012021002).
The spelling of 200100210001 in words is "two hundred billion, one hundred million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •