Base | Representation |
---|---|
bin | 10000000001011010000… |
… | …010000010000111111000 |
3 | 10220020221010100100100002 |
4 | 100001122002002013320 |
5 | 121014343130011300 |
6 | 2201445204532132 |
7 | 142355232343445 |
oct | 20013202020770 |
9 | 3806833310302 |
10 | 1101022110200 |
11 | 394a39306571 |
12 | 1594760b1048 |
13 | 7ca977871cc |
14 | 3b40b12c9cc |
15 | 1d99059d5d5 |
hex | 1005a0821f8 |
1101022110200 has 96 divisors (see below), whose sum is σ = 2566450312560. Its totient is φ = 439279027200.
The previous prime is 1101022110191. The next prime is 1101022110217. The reversal of 1101022110200 is 20112201011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 245597159 + ... + 245601641.
Almost surely, 21101022110200 is an apocalyptic number.
1101022110200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101022110200 is an abundant number, since it is smaller than the sum of its proper divisors (1465428202360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101022110200 is a wasteful number, since it uses less digits than its factorization.
1101022110200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7377 (or 7368 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1101022110200 its reverse (20112201011), we get a palindrome (1121134311211).
The spelling of 1101022110200 in words is "one trillion, one hundred one billion, twenty-two million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •