Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …001010101011111000110 |
3 | 10220011022122221201012122 |
4 | 100000131301111133012 |
5 | 121010310320200402 |
6 | 2201201011245542 |
7 | 142321205035235 |
oct | 20003561253706 |
9 | 3804278851178 |
10 | 1100011100102 |
11 | 39456a652732 |
12 | 1592335a98b2 |
13 | 7c966193795 |
14 | 3b352b56b1c |
15 | 1d931944ca2 |
hex | 1001dc557c6 |
1100011100102 has 16 divisors (see below), whose sum is σ = 1736889791040. Its totient is φ = 521048841768.
The previous prime is 1100011100063. The next prime is 1100011100119. The reversal of 1100011100102 is 2010011100011.
It is a happy number.
It is a super-2 number, since 2×11000111001022 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1100011100102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2303033 + ... + 2739339.
It is an arithmetic number, because the mean of its divisors is an integer number (108555611940).
Almost surely, 21100011100102 is an apocalyptic number.
1100011100102 is a deficient number, since it is larger than the sum of its proper divisors (636878690938).
1100011100102 is a wasteful number, since it uses less digits than its factorization.
1100011100102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 502675.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1100011100102 its reverse (2010011100011), we get a palindrome (3110022200113).
Subtracting 1100011100102 from its reverse (2010011100011), we obtain a palindrome (909999999909).
The spelling of 1100011100102 in words is "one trillion, one hundred billion, eleven million, one hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •