Base | Representation |
---|---|
bin | 1010000110000111001000… |
… | …0111010011011011101101 |
3 | 1110022011022202022010001000 |
4 | 2201201302013103123231 |
5 | 2423331011130310333 |
6 | 35335153052310513 |
7 | 2223646034215056 |
oct | 241416207233355 |
9 | 43264282263030 |
10 | 11100110010093 |
11 | 359a5917a3245 |
12 | 12b3338472439 |
13 | 626974970610 |
14 | 2a536907172d |
15 | 143b153c4713 |
hex | a18721d36ed |
11100110010093 has 16 divisors (see below), whose sum is σ = 17709577224640. Its totient is φ = 6830836929072.
The previous prime is 11100110010083. The next prime is 11100110010151. The reversal of 11100110010093 is 39001001100111.
11100110010093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11100110010093 - 28 = 11100110009837 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100110010083) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15812122171 + ... + 15812122872.
It is an arithmetic number, because the mean of its divisors is an integer number (1106848576540).
Almost surely, 211100110010093 is an apocalyptic number.
11100110010093 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11100110010093 is a deficient number, since it is larger than the sum of its proper divisors (6609467214547).
11100110010093 is a wasteful number, since it uses less digits than its factorization.
11100110010093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31624245065 (or 31624245059 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 18.
The spelling of 11100110010093 in words is "eleven trillion, one hundred billion, one hundred ten million, ten thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •