Base | Representation |
---|---|
bin | 110010010010111000101010… |
… | …101101010110101100010101 |
3 | 1002000012112011211202122022101 |
4 | 302102320222231112230111 |
5 | 212443120322241223333 |
6 | 2102241533331402101 |
7 | 64410116143663144 |
oct | 6222705255265425 |
9 | 1060175154678271 |
10 | 221200122211093 |
11 | 64532499349483 |
12 | 20986095453331 |
13 | 965710b279a6c |
14 | 3c8a2006dd75b |
15 | 1a88dc970167d |
hex | c92e2ab56b15 |
221200122211093 has 2 divisors, whose sum is σ = 221200122211094. Its totient is φ = 221200122211092.
The previous prime is 221200122211087. The next prime is 221200122211181. The reversal of 221200122211093 is 390112221002122.
221200122211093 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., 193918074149809 + 27282048061284 = 13925447^2 + 5223222^2 .
It is a cyclic number.
It is not a de Polignac number, because 221200122211093 - 29 = 221200122210581 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221200122211193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110600061105546 + 110600061105547.
It is an arithmetic number, because the mean of its divisors is an integer number (110600061105547).
Almost surely, 2221200122211093 is an apocalyptic number.
It is an amenable number.
221200122211093 is a deficient number, since it is larger than the sum of its proper divisors (1).
221200122211093 is an equidigital number, since it uses as much as digits as its factorization.
221200122211093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 221200122211093 in words is "two hundred twenty-one trillion, two hundred billion, one hundred twenty-two million, two hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •