Base | Representation |
---|---|
bin | 1100110011110011100… |
… | …1101111010110100101 |
3 | 210001000201022102211111 |
4 | 3030330321233112211 |
5 | 12101143131214341 |
6 | 245032502505021 |
7 | 21620263332250 |
oct | 3147471572645 |
9 | 701021272744 |
10 | 220065101221 |
11 | 85369015789 |
12 | 36797435171 |
13 | 179a133b934 |
14 | a918cb2097 |
15 | 5acec9e681 |
hex | 333ce6f5a5 |
220065101221 has 8 divisors (see below), whose sum is σ = 251509006784. Its totient is φ = 188622704160.
The previous prime is 220065101219. The next prime is 220065101287. The reversal of 220065101221 is 122101560022.
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 220065101221 - 21 = 220065101219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220065101192 and 220065101201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220065101521) 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, 45015 + ... + 664948.
It is an arithmetic number, because the mean of its divisors is an integer number (31438625848).
Almost surely, 2220065101221 is an apocalyptic number.
It is an amenable number.
220065101221 is a deficient number, since it is larger than the sum of its proper divisors (31443905563).
220065101221 is an equidigital number, since it uses as much as digits as its factorization.
220065101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 754251.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 220065101221 its reverse (122101560022), we get a palindrome (342166661243).
The spelling of 220065101221 in words is "two hundred twenty billion, sixty-five million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •