Base | Representation |
---|---|
bin | 101101100001100101011010… |
… | …101100010101111001011101 |
3 | 222020220211211220001020110011 |
4 | 231201211122230111321131 |
5 | 202220401041033323401 |
6 | 1545455445334243221 |
7 | 60113263355462305 |
oct | 5541453254257135 |
9 | 866824756036404 |
10 | 200220012011101 |
11 | 588839150676a5 |
12 | 1a557b90ab6511 |
13 | 87948875cca34 |
14 | 37629b3836605 |
15 | 18232ae353451 |
hex | b6195ab15e5d |
200220012011101 has 4 divisors (see below), whose sum is σ = 200226144920032. Its totient is φ = 200213879102172.
The previous prime is 200220012011081. The next prime is 200220012011147. The reversal of 200220012011101 is 101110210022002.
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 200220012011101 - 27 = 200220012010973 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 (200220012011401) 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, 3066405495 + ... + 3066470788.
It is an arithmetic number, because the mean of its divisors is an integer number (50056536230008).
Almost surely, 2200220012011101 is an apocalyptic number.
It is an amenable number.
200220012011101 is a deficient number, since it is larger than the sum of its proper divisors (6132908931).
200220012011101 is an equidigital number, since it uses as much as digits as its factorization.
200220012011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6132908930.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200220012011101 its reverse (101110210022002), we get a palindrome (301330222033103).
The spelling of 200220012011101 in words is "two hundred trillion, two hundred twenty billion, twelve million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •