Base | Representation |
---|---|
bin | 1010000010111100010011… |
… | …1100110110101101100101 |
3 | 1110002221210101210110012202 |
4 | 2200233010330312231211 |
5 | 2421433010243030333 |
6 | 35254150351224245 |
7 | 2220010611054131 |
oct | 240570474665545 |
9 | 43087711713182 |
10 | 11045665205093 |
11 | 3579493059432 |
12 | 12a4882b18085 |
13 | 6217a90b0c7c |
14 | 2a28822c23c1 |
15 | 1424ca6e55e8 |
hex | a0bc4f36b65 |
11045665205093 has 2 divisors, whose sum is σ = 11045665205094. Its totient is φ = 11045665205092.
The previous prime is 11045665205089. The next prime is 11045665205231. The reversal of 11045665205093 is 39050256654011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5865202425124 + 5180462779969 = 2421818^2 + 2276063^2 .
It is an emirp because it is prime and its reverse (39050256654011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11045665205093 - 22 = 11045665205089 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11045665205023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5522832602546 + 5522832602547.
It is an arithmetic number, because the mean of its divisors is an integer number (5522832602547).
Almost surely, 211045665205093 is an apocalyptic number.
It is an amenable number.
11045665205093 is a deficient number, since it is larger than the sum of its proper divisors (1).
11045665205093 is an equidigital number, since it uses as much as digits as its factorization.
11045665205093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972000, while the sum is 47.
The spelling of 11045665205093 in words is "eleven trillion, forty-five billion, six hundred sixty-five million, two hundred five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •