Base | Representation |
---|---|
bin | 1100110100010110001… |
… | …0100100001101100101 |
3 | 210001101211000010200220 |
4 | 3031011202210031211 |
5 | 12101442231134341 |
6 | 245055120554553 |
7 | 21624003203451 |
oct | 3150542441545 |
9 | 701354003626 |
10 | 220210021221 |
11 | 854328a8283 |
12 | 36817a82a59 |
13 | 179c537c508 |
14 | a930237661 |
15 | 5adc878a66 |
hex | 33458a4365 |
220210021221 has 8 divisors (see below), whose sum is σ = 293618035584. Its totient is φ = 146804343840.
The previous prime is 220210021193. The next prime is 220210021231. The reversal of 220210021221 is 122120012022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220210021221 - 214 = 220210004837 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220210021221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220210021231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 351085 + ... + 750786.
It is an arithmetic number, because the mean of its divisors is an integer number (36702254448).
Almost surely, 2220210021221 is an apocalyptic number.
It is an amenable number.
220210021221 is a deficient number, since it is larger than the sum of its proper divisors (73408014363).
220210021221 is a wasteful number, since it uses less digits than its factorization.
220210021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1168491.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 220210021221 its reverse (122120012022), we get a palindrome (342330033243).
The spelling of 220210021221 in words is "two hundred twenty billion, two hundred ten million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •