Base | Representation |
---|---|
bin | 11001010010001011001010… |
… | …100101000010111000010001 |
3 | 112120201121220022012010210112 |
4 | 121102023022211002320101 |
5 | 104033400302103032233 |
6 | 1032300342134411105 |
7 | 32264641122314231 |
oct | 3122131245027021 |
9 | 476647808163715 |
10 | 111200102002193 |
11 | 32482775666016 |
12 | 1057b3a9200a95 |
13 | 4a08180a51099 |
14 | 1d66183c1bcc1 |
15 | ccc88334b048 |
hex | 6522ca942e11 |
111200102002193 has 2 divisors, whose sum is σ = 111200102002194. Its totient is φ = 111200102002192.
The previous prime is 111200102002181. The next prime is 111200102002207. The reversal of 111200102002193 is 391200201002111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89606822023744 + 21593279978449 = 9466088^2 + 4646857^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111200102002193 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (111200102002163) 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, 55600051001096 + 55600051001097.
It is an arithmetic number, because the mean of its divisors is an integer number (55600051001097).
Almost surely, 2111200102002193 is an apocalyptic number.
It is an amenable number.
111200102002193 is a deficient number, since it is larger than the sum of its proper divisors (1).
111200102002193 is an equidigital number, since it uses as much as digits as its factorization.
111200102002193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 23.
The spelling of 111200102002193 in words is "one hundred eleven trillion, two hundred billion, one hundred two million, two thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •