Base | Representation |
---|---|
bin | 1100110011100100010… |
… | …1101000111111000001 |
3 | 210000212020220110010101 |
4 | 3030321011220333001 |
5 | 12101030241041001 |
6 | 245022255202401 |
7 | 21615555411616 |
oct | 3147105507701 |
9 | 700766813111 |
10 | 220001112001 |
11 | 8533598a730 |
12 | 36779b16401 |
13 | 17990cc5ca8 |
14 | a9105b650d |
15 | 5ac935ea01 |
hex | 3339168fc1 |
220001112001 has 8 divisors (see below), whose sum is σ = 240021885600. Its totient is φ = 199983783840.
The previous prime is 220001111987. The next prime is 220001112041. The reversal of 220001112001 is 100211100022.
220001112001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 220001112001 - 217 = 220000980929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220001112041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 726931 + ... + 984088.
It is an arithmetic number, because the mean of its divisors is an integer number (30002735700).
Almost surely, 2220001112001 is an apocalyptic number.
It is an amenable number.
220001112001 is a deficient number, since it is larger than the sum of its proper divisors (20020773599).
220001112001 is a wasteful number, since it uses less digits than its factorization.
220001112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1722719.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 220001112001 its reverse (100211100022), we get a palindrome (320212212023).
The spelling of 220001112001 in words is "two hundred twenty billion, one million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •