Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …111101100001000101101 |
3 | 10220020220100110101212000 |
4 | 100001121113230020231 |
5 | 121014332304310333 |
6 | 2201444131002513 |
7 | 142355036112561 |
oct | 20013127541055 |
9 | 3806810411760 |
10 | 1101011010093 |
11 | 394a33014925 |
12 | 159472439439 |
13 | 7ca9539b9b7 |
14 | 3b40987d6a1 |
15 | 1d98e609713 |
hex | 100595ec22d |
1101011010093 has 64 divisors (see below), whose sum is σ = 1651197888000. Its totient is φ = 725043571200.
The previous prime is 1101011010067. The next prime is 1101011010101. The reversal of 1101011010093 is 3900101101011.
It is not a de Polignac number, because 1101011010093 - 225 = 1100977455661 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101011010493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 710787483 + ... + 710789031.
It is an arithmetic number, because the mean of its divisors is an integer number (25799967000).
Almost surely, 21101011010093 is an apocalyptic number.
It is an amenable number.
1101011010093 is a deficient number, since it is larger than the sum of its proper divisors (550186877907).
1101011010093 is a wasteful number, since it uses less digits than its factorization.
1101011010093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2579 (or 2573 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 18.
The spelling of 1101011010093 in words is "one trillion, one hundred one billion, eleven million, ten thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •