Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …001101101111001100101 |
3 | 10220011022200010210101022 |
4 | 100000131301231321211 |
5 | 121010310331400401 |
6 | 2201201013340525 |
7 | 142321205632622 |
oct | 20003561557145 |
9 | 3804280123338 |
10 | 1100011200101 |
11 | 39456a710880 |
12 | 159233637745 |
13 | 7c9661ca158 |
14 | 3b352b81349 |
15 | 1d93196471b |
hex | 1001dc6de65 |
1100011200101 has 16 divisors (see below), whose sum is σ = 1213117641216. Its totient is φ = 989109000000.
The previous prime is 1100011200089. The next prime is 1100011200107. The reversal of 1100011200101 is 1010021100011.
It is a happy number.
It is not a de Polignac number, because 1100011200101 - 26 = 1100011200037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100011200107) 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, 601451 + ... + 1600551.
It is an arithmetic number, because the mean of its divisors is an integer number (75819852576).
Almost surely, 21100011200101 is an apocalyptic number.
1100011200101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1100011200101 is a deficient number, since it is larger than the sum of its proper divisors (113106441115).
1100011200101 is a wasteful number, since it uses less digits than its factorization.
1100011200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000204.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1100011200101 its reverse (1010021100011), we get a palindrome (2110032300112).
The spelling of 1100011200101 in words is "one trillion, one hundred billion, eleven million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •