Base | Representation |
---|---|
bin | 110010001111111110011111… |
… | …100111101101000000111101 |
3 | 1001222111102012022212100201120 |
4 | 302033332133213231000331 |
5 | 212431331422332413041 |
6 | 2102010033301501153 |
7 | 64356511322640102 |
oct | 6217763747550075 |
9 | 1058442168770646 |
10 | 221000220201021 |
11 | 64465737926598 |
12 | 209533a67117b9 |
13 | 96413013494c1 |
14 | 3c80679648aa9 |
15 | 1a83ac9b86366 |
hex | c8ff9f9ed03d |
221000220201021 has 4 divisors (see below), whose sum is σ = 294666960268032. Its totient is φ = 147333480134012.
The previous prime is 221000220200999. The next prime is 221000220201053. The reversal of 221000220201021 is 120102022000122.
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 221000220201021 - 235 = 220965860462653 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221000220271021) 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, 36833370033501 + ... + 36833370033506.
It is an arithmetic number, because the mean of its divisors is an integer number (73666740067008).
Almost surely, 2221000220201021 is an apocalyptic number.
It is an amenable number.
221000220201021 is a deficient number, since it is larger than the sum of its proper divisors (73666740067011).
221000220201021 is an equidigital number, since it uses as much as digits as its factorization.
221000220201021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73666740067010.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 221000220201021 its reverse (120102022000122), we get a palindrome (341102242201143).
The spelling of 221000220201021 in words is "two hundred twenty-one trillion, two hundred twenty million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •