Base | Representation |
---|---|
bin | 1000001100110010… |
… | …0110110101011101 |
3 | 12200101210111010102 |
4 | 2003030212311131 |
5 | 14001441320333 |
6 | 1002225350445 |
7 | 105355132514 |
oct | 20314466535 |
9 | 5611714112 |
10 | 2201120093 |
11 | a2a525117 |
12 | 515198425 |
13 | 291034433 |
14 | 16c48d67b |
15 | cd38dae8 |
hex | 83326d5d |
2201120093 has 2 divisors, whose sum is σ = 2201120094. Its totient is φ = 2201120092.
The previous prime is 2201120087. The next prime is 2201120111. The reversal of 2201120093 is 3900211022.
2201120093 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., 1398984409 + 802135684 = 37403^2 + 28322^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201120093 - 26 = 2201120029 is a prime.
It is a super-3 number, since 3×22011200933 (a number of 29 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201120003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100560046 + 1100560047.
It is an arithmetic number, because the mean of its divisors is an integer number (1100560047).
Almost surely, 22201120093 is an apocalyptic number.
It is an amenable number.
2201120093 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201120093 is an equidigital number, since it uses as much as digits as its factorization.
2201120093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 2201120093 is about 46916.0963103283. The cubic root of 2201120093 is about 1300.8121341564.
The spelling of 2201120093 in words is "two billion, two hundred one million, one hundred twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •