Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …100011101110101000101 |
3 | 10220011112212020100102221 |
4 | 100000203010131311011 |
5 | 121011001100013333 |
6 | 2201213504532341 |
7 | 142323334502632 |
oct | 20004304356505 |
9 | 3804485210387 |
10 | 1100100001093 |
11 | 394605853325 |
12 | 1592593210b1 |
13 | 7c97b71c412 |
14 | 3b360899189 |
15 | 1d939655d2d |
hex | 1002311dd45 |
1100100001093 has 2 divisors, whose sum is σ = 1100100001094. Its totient is φ = 1100100001092.
The previous prime is 1100100001087. The next prime is 1100100001103. The reversal of 1100100001093 is 3901000010011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1097587284964 + 2512716129 = 1047658^2 + 50127^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100100001093 - 25 = 1100100001061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100100001493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550050000546 + 550050000547.
It is an arithmetic number, because the mean of its divisors is an integer number (550050000547).
Almost surely, 21100100001093 is an apocalyptic number.
It is an amenable number.
1100100001093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100100001093 is an equidigital number, since it uses as much as digits as its factorization.
1100100001093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 16.
The spelling of 1100100001093 in words is "one trillion, one hundred billion, one hundred million, one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •