Base | Representation |
---|---|
bin | 110010000011000001011011… |
… | …100111101101011111010001 |
3 | 1001212100022102211020122112120 |
4 | 302003001123213231133101 |
5 | 212322240310401401001 |
6 | 2100045051530044453 |
7 | 64235265341421153 |
oct | 6203013347553721 |
9 | 1055308384218476 |
10 | 220110021122001 |
11 | 6415215473779a |
12 | 2082a968879729 |
13 | 95a839425682a |
14 | 3c4d54bba2ad3 |
15 | 1a6a877ce1236 |
hex | c8305b9ed7d1 |
220110021122001 has 8 divisors (see below), whose sum is σ = 293480130788544. Its totient is φ = 146739962768400.
The previous prime is 220110021121979. The next prime is 220110021122003. The reversal of 220110021122001 is 100221120011022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220110021122001 - 26 = 220110021121937 is a prime.
It is not an unprimeable number, because it can be changed into a prime (220110021122003) 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, 1352781 + ... + 21024986.
It is an arithmetic number, because the mean of its divisors is an integer number (36685016348568).
Almost surely, 2220110021122001 is an apocalyptic number.
It is an amenable number.
220110021122001 is a deficient number, since it is larger than the sum of its proper divisors (73370109666543).
220110021122001 is a wasteful number, since it uses less digits than its factorization.
220110021122001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25656471.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 220110021122001 its reverse (100221120011022), we get a palindrome (320331141133023).
It can be divided in two parts, 220110021 and 122001, that added together give a palindrome (220232022).
The spelling of 220110021122001 in words is "two hundred twenty trillion, one hundred ten billion, twenty-one million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •