Base | Representation |
---|---|
bin | 10000000000101010010… |
… | …101110110111111001001 |
3 | 10220011212100210120222121 |
4 | 100000222111312333021 |
5 | 121011223313013342 |
6 | 2201233543451241 |
7 | 142326345464032 |
oct | 20005225667711 |
9 | 3804770716877 |
10 | 1100222001097 |
11 | 39466870077a |
12 | 159292156b21 |
13 | 7c99aa9677b |
14 | 3b372b75a89 |
15 | 1d945204067 |
hex | 1002a576fc9 |
1100222001097 has 16 divisors (see below), whose sum is σ = 1207894721040. Its totient is φ = 997486866432.
The previous prime is 1100222001089. The next prime is 1100222001107. The reversal of 1100222001097 is 7901002220011.
It can be written as a sum of positive squares in 8 ways, for example, as 32504844681 + 1067717156416 = 180291^2 + 1033304^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100222001097 - 23 = 1100222001089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1100222001007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2363538 + ... + 2790475.
It is an arithmetic number, because the mean of its divisors is an integer number (75493420065).
Almost surely, 21100222001097 is an apocalyptic number.
1100222001097 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1100222001097 is a deficient number, since it is larger than the sum of its proper divisors (107672719943).
1100222001097 is a wasteful number, since it uses less digits than its factorization.
1100222001097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5154492.
The product of its (nonzero) digits is 504, while the sum is 25.
The spelling of 1100222001097 in words is "one trillion, one hundred billion, two hundred twenty-two million, one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •