Base | Representation |
---|---|
bin | 110010000011001010101110… |
… | …011010000111011111010001 |
3 | 1001212101021012021021021110201 |
4 | 302003022232122013133101 |
5 | 212322421230000031001 |
6 | 2100053422040055201 |
7 | 64236100541460601 |
oct | 6203125632073721 |
9 | 1055337167237421 |
10 | 220120000002001 |
11 | 64156405536a60 |
12 | 20830892764501 |
13 | 95a92c475ab58 |
14 | 3c4dc171c8c01 |
15 | 1a6ac5ddcb501 |
hex | c832ae6877d1 |
220120000002001 has 8 divisors (see below), whose sum is σ = 240136159896864. Its totient is φ = 200104715241120.
The previous prime is 220120000001969. The next prime is 220120000002041. The reversal of 220120000002001 is 100200000021022.
220120000002001 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 220120000002001 - 25 = 220120000001969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (220120000002041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 218257515 + ... + 219263728.
It is an arithmetic number, because the mean of its divisors is an integer number (30017019987108).
Almost surely, 2220120000002001 is an apocalyptic number.
It is an amenable number.
220120000002001 is a deficient number, since it is larger than the sum of its proper divisors (20016159894863).
220120000002001 is a wasteful number, since it uses less digits than its factorization.
220120000002001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 437566991.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 220120000002001 its reverse (100200000021022), we get a palindrome (320320000023023).
The spelling of 220120000002001 in words is "two hundred twenty trillion, one hundred twenty billion, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •