Base | Representation |
---|---|
bin | 1010000110000110110001… |
… | …0001011101101001101101 |
3 | 1110022011001220220012022101 |
4 | 2201201230101131221231 |
5 | 2423330311033310333 |
6 | 35335135232015101 |
7 | 2223643434222556 |
oct | 241415421355155 |
9 | 43264056805271 |
10 | 11100012010093 |
11 | 359a541448406 |
12 | 12b330b691491 |
13 | 62695a57a256 |
14 | 2a535a04132d |
15 | 143b0b9b767d |
hex | a186c45da6d |
11100012010093 has 4 divisors (see below), whose sum is σ = 11100328708828. Its totient is φ = 11099695311360.
The previous prime is 11100012010069. The next prime is 11100012010121. The reversal of 11100012010093 is 39001021000111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1907970351849 + 9192041658244 = 1381293^2 + 3031838^2 .
It is a cyclic number.
It is not a de Polignac number, because 11100012010093 - 213 = 11100012001901 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11100012010093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100012010393) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 158296788 + ... + 158366893.
It is an arithmetic number, because the mean of its divisors is an integer number (2775082177207).
Almost surely, 211100012010093 is an apocalyptic number.
It is an amenable number.
11100012010093 is a deficient number, since it is larger than the sum of its proper divisors (316698735).
11100012010093 is an equidigital number, since it uses as much as digits as its factorization.
11100012010093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316698734.
The product of its (nonzero) digits is 54, while the sum is 19.
The spelling of 11100012010093 in words is "eleven trillion, one hundred billion, twelve million, ten thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •