Base | Representation |
---|---|
bin | 100000000001110101110… |
… | …101000110110001100001 |
3 | 21210102011111000110010002 |
4 | 200001311311012301201 |
5 | 242030122012024301 |
6 | 4403043034545345 |
7 | 315005556155123 |
oct | 40016565066141 |
9 | 7712144013102 |
10 | 2201000111201 |
11 | 779491201371 |
12 | 2b669a598255 |
13 | 12c726b2c208 |
14 | 7875970b213 |
15 | 3c3be15616b |
hex | 20075d46c61 |
2201000111201 has 4 divisors (see below), whose sum is σ = 2204222659632. Its totient is φ = 2197777562772.
The previous prime is 2201000111183. The next prime is 2201000111203. The reversal of 2201000111201 is 1021110001022.
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 2201000111201 - 238 = 1926122204257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2201000111203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1611273191 + ... + 1611274556.
It is an arithmetic number, because the mean of its divisors is an integer number (551055664908).
Almost surely, 22201000111201 is an apocalyptic number.
It is an amenable number.
2201000111201 is a deficient number, since it is larger than the sum of its proper divisors (3222548431).
2201000111201 is an equidigital number, since it uses as much as digits as its factorization.
2201000111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3222548430.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2201000111201 its reverse (1021110001022), we get a palindrome (3222110112223).
The spelling of 2201000111201 in words is "two trillion, two hundred one billion, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •