Base | Representation |
---|---|
bin | 101101011110011001100010… |
… | …101001010101110110010101 |
3 | 222020010220210200110001102001 |
4 | 231132121202221111312111 |
5 | 202203304224120010401 |
6 | 1545211123215315301 |
7 | 60061413520146505 |
oct | 5536314251256625 |
9 | 866126720401361 |
10 | 200001102110101 |
11 | 587a9a9a139a46 |
12 | 1a52167851bb31 |
13 | 877a03b6cb136 |
14 | 3756168151a05 |
15 | 181c74abe0601 |
hex | b5e662a55d95 |
200001102110101 has 4 divisors (see below), whose sum is σ = 200001145872352. Its totient is φ = 200001058347852.
The previous prime is 200001102110087. The next prime is 200001102110189. The reversal of 200001102110101 is 101011201100002.
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 200001102110101 - 231 = 199998954626453 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200001102110191) 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, 14104611 + ... + 24473296.
It is an arithmetic number, because the mean of its divisors is an integer number (50000286468088).
Almost surely, 2200001102110101 is an apocalyptic number.
It is an amenable number.
200001102110101 is a deficient number, since it is larger than the sum of its proper divisors (43762251).
200001102110101 is an equidigital number, since it uses as much as digits as its factorization.
200001102110101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43762250.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 200001102110101 its reverse (101011201100002), we get a palindrome (301012303210103).
The spelling of 200001102110101 in words is "two hundred trillion, one billion, one hundred two million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •