Base | Representation |
---|---|
bin | 110010000010111011000110… |
… | …111110000110111110101101 |
3 | 1001212022122220200201202021111 |
4 | 302002323012332012332231 |
5 | 212322132404422033401 |
6 | 2100042010132232021 |
7 | 64234635164624155 |
oct | 6202730676067655 |
9 | 1055278820652244 |
10 | 220103232221101 |
11 | 6414a290566a99 |
12 | 2082959316b611 |
13 | 95a78518c2ac8 |
14 | 3c4d0a62b7765 |
15 | 1a6a5cbcc4e51 |
hex | c82ec6f86fad |
220103232221101 has 8 divisors (see below), whose sum is σ = 220223805086880. Its totient is φ = 219982692341232.
The previous prime is 220103232221071. The next prime is 220103232221141. The reversal of 220103232221101 is 101122232301022.
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 220103232221101 - 235 = 220068872482733 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220103232221141) 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, 5108386 + ... + 21594028.
It is an arithmetic number, because the mean of its divisors is an integer number (27527975635860).
Almost surely, 2220103232221101 is an apocalyptic number.
It is an amenable number.
220103232221101 is a deficient number, since it is larger than the sum of its proper divisors (120572865779).
220103232221101 is a wasteful number, since it uses less digits than its factorization.
220103232221101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16492955.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 220103232221101 its reverse (101122232301022), we get a palindrome (321225464522123).
The spelling of 220103232221101 in words is "two hundred twenty trillion, one hundred three billion, two hundred thirty-two million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •