Base | Representation |
---|---|
bin | 1100110100011000110… |
… | …0011100110100111101 |
3 | 210001102120122222011011 |
4 | 3031012030130310331 |
5 | 12102003034013041 |
6 | 245100152155221 |
7 | 21624165423520 |
oct | 3150614346475 |
9 | 701376588134 |
10 | 220221001021 |
11 | 8543901759a |
12 | 3681b698b11 |
13 | 179c7725038 |
14 | a931894bb7 |
15 | 5add7e6e81 |
hex | 334631cd3d |
220221001021 has 4 divisors (see below), whose sum is σ = 251681144032. Its totient is φ = 188760858012.
The previous prime is 220221000997. The next prime is 220221001037. The reversal of 220221001021 is 120100122022.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 220221001021 - 221 = 220218903869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220221000992 and 220221001010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220221001621) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15730071495 + ... + 15730071508.
It is an arithmetic number, because the mean of its divisors is an integer number (62920286008).
Almost surely, 2220221001021 is an apocalyptic number.
It is an amenable number.
220221001021 is a deficient number, since it is larger than the sum of its proper divisors (31460143011).
220221001021 is an equidigital number, since it uses as much as digits as its factorization.
220221001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31460143010.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 220221001021 its reverse (120100122022), we get a palindrome (340321123043).
The spelling of 220221001021 in words is "two hundred twenty billion, two hundred twenty-one million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •