Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …000011101011111101000 |
3 | 10220011211112101222000122 |
4 | 100000221220131133220 |
5 | 121011212241201300 |
6 | 2201232440422412 |
7 | 142326142356401 |
oct | 20005150353750 |
9 | 3804745358018 |
10 | 1100210100200 |
11 | 394661a12422 |
12 | 15928a177a08 |
13 | 7c99848a913 |
14 | 3b3713589a8 |
15 | 1d944152c85 |
hex | 10029a1d7e8 |
1100210100200 has 72 divisors (see below), whose sum is σ = 2618860911750. Its totient is φ = 429849383040.
The previous prime is 1100210100139. The next prime is 1100210100217. The reversal of 1100210100200 is 20010120011.
It can be written as a sum of positive squares in 3 ways, for example, as 981696529636 + 118513570564 = 990806^2 + 344258^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 1117775 + ... + 1857374.
Almost surely, 21100210100200 is an apocalyptic number.
1100210100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1100210100200 is an abundant number, since it is smaller than the sum of its proper divisors (1518650811550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100210100200 is a wasteful number, since it uses less digits than its factorization.
1100210100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2975251 (or 2975199 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1100210100200 its reverse (20010120011), we get a palindrome (1120220220211).
The spelling of 1100210100200 in words is "one trillion, one hundred billion, two hundred ten million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •