Base | Representation |
---|---|
bin | 1100110111101010100… |
… | …1011101101101000101 |
3 | 210010200220120200000112 |
4 | 3031322221131231011 |
5 | 12110303330201041 |
6 | 245323350122405 |
7 | 21655042451435 |
oct | 3157251355505 |
9 | 703626520015 |
10 | 221101022021 |
11 | 8584a843380 |
12 | 36a26350405 |
13 | 17b07b44a19 |
14 | a9b66d02c5 |
15 | 5b40bc8deb |
hex | 337aa5db45 |
221101022021 has 4 divisors (see below), whose sum is σ = 241201114944. Its totient is φ = 201000929100.
The previous prime is 221101022011. The next prime is 221101022027. The reversal of 221101022021 is 120220101122.
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 221101022021 - 234 = 203921152837 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 221101021987 and 221101022005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221101022027) 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, 10050046445 + ... + 10050046466.
It is an arithmetic number, because the mean of its divisors is an integer number (60300278736).
Almost surely, 2221101022021 is an apocalyptic number.
It is an amenable number.
221101022021 is a deficient number, since it is larger than the sum of its proper divisors (20100092923).
221101022021 is a wasteful number, since it uses less digits than its factorization.
221101022021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20100092922.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 221101022021 its reverse (120220101122), we get a palindrome (341321123143).
The spelling of 221101022021 in words is "two hundred twenty-one billion, one hundred one million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •