Base | Representation |
---|---|
bin | 110010010011000001111000… |
… | …101111000101011011001101 |
3 | 1002000020110201201111111120102 |
4 | 302103001320233011123031 |
5 | 212443301110413101333 |
6 | 2102250251505500445 |
7 | 64410616354123421 |
oct | 6223017057053315 |
9 | 1060213651444512 |
10 | 221210021222093 |
11 | 64536709056a02 |
12 | 20987b98641725 |
13 | 9658028068517 |
14 | 3c8a89d294b81 |
15 | 1a892a87b1ae8 |
hex | c93078bc56cd |
221210021222093 has 2 divisors, whose sum is σ = 221210021222094. Its totient is φ = 221210021222092.
The previous prime is 221210021222089. The next prime is 221210021222137. The reversal of 221210021222093 is 390222120012122.
221210021222093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 156517164105124 + 64692857116969 = 12510682^2 + 8043187^2 .
It is a cyclic number.
It is not a de Polignac number, because 221210021222093 - 22 = 221210021222089 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221210021222023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110605010611046 + 110605010611047.
It is an arithmetic number, because the mean of its divisors is an integer number (110605010611047).
Almost surely, 2221210021222093 is an apocalyptic number.
It is an amenable number.
221210021222093 is a deficient number, since it is larger than the sum of its proper divisors (1).
221210021222093 is an equidigital number, since it uses as much as digits as its factorization.
221210021222093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 29.
The spelling of 221210021222093 in words is "two hundred twenty-one trillion, two hundred ten billion, twenty-one million, two hundred twenty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •