Base | Representation |
---|---|
bin | 110010000100010110010110… |
… | …010011111100111001100001 |
3 | 1001212200000210020121012210120 |
4 | 302010112112103330321201 |
5 | 212330234024212024301 |
6 | 2100155011304150453 |
7 | 64245004005144051 |
oct | 6204262623747141 |
9 | 1055600706535716 |
10 | 220201200111201 |
11 | 64187893913921 |
12 | 20844574468429 |
13 | 95b3b653c4a4a |
14 | 3c53b1b4c1561 |
15 | 1a6ce12907e36 |
hex | c845964fce61 |
220201200111201 has 8 divisors (see below), whose sum is σ = 293615734039680. Its totient is φ = 146793733128432.
The previous prime is 220201200111169. The next prime is 220201200111281. The reversal of 220201200111201 is 102111002102022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220201200111201 - 25 = 220201200111169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (220201200111281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1766663721 + ... + 1766788358.
It is an arithmetic number, because the mean of its divisors is an integer number (36701966754960).
Almost surely, 2220201200111201 is an apocalyptic number.
It is an amenable number.
220201200111201 is a deficient number, since it is larger than the sum of its proper divisors (73414533928479).
220201200111201 is a wasteful number, since it uses less digits than its factorization.
220201200111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3533472855.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 220201200111201 its reverse (102111002102022), we get a palindrome (322312202213223).
The spelling of 220201200111201 in words is "two hundred twenty trillion, two hundred one billion, two hundred million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •