Base | Representation |
---|---|
bin | 1000001100110011… |
… | …1111011111100101 |
3 | 12200101222121200011 |
4 | 2003030333133211 |
5 | 14002003033333 |
6 | 1002231450221 |
7 | 105356033131 |
oct | 20314773745 |
9 | 5611877604 |
10 | 2201221093 |
11 | a2a593a95 |
12 | 515226971 |
13 | 29106b3b6 |
14 | 16c4b83c1 |
15 | cd3ad9cd |
hex | 8333f7e5 |
2201221093 has 2 divisors, whose sum is σ = 2201221094. Its totient is φ = 2201221092.
The previous prime is 2201221091. The next prime is 2201221103. The reversal of 2201221093 is 3901221022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1154504484 + 1046716609 = 33978^2 + 32353^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201221093 - 21 = 2201221091 is a prime.
It is a super-2 number, since 2×22012210932 = 9690748600536229298, which contains 22 as substring.
Together with 2201221091, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201221091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100610546 + 1100610547.
It is an arithmetic number, because the mean of its divisors is an integer number (1100610547).
Almost surely, 22201221093 is an apocalyptic number.
It is an amenable number.
2201221093 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201221093 is an equidigital number, since it uses as much as digits as its factorization.
2201221093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 2201221093 is about 46917.1726876205. The cubic root of 2201221093 is about 1300.8320300898.
The spelling of 2201221093 in words is "two billion, two hundred one million, two hundred twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •