Base | Representation |
---|---|
bin | 10000000011010111110… |
… | …110111011110111011000 |
3 | 10220110101020121021101000 |
4 | 100003113312323313120 |
5 | 121033204040131300 |
6 | 2202434455225000 |
7 | 142461444615633 |
oct | 20032766736730 |
9 | 3813336537330 |
10 | 1103133130200 |
11 | 3959219910a2 |
12 | 159965078160 |
13 | 80042c32c7a |
14 | 3b56b646c1a |
15 | 1da65a90c00 |
hex | 100d7dbbdd8 |
1103133130200 has 192 divisors, whose sum is σ = 3837303280800. Its totient is φ = 291256128000.
The previous prime is 1103133130139. The next prime is 1103133130279. The reversal of 1103133130200 is 20313313011.
It is a happy number.
1103133130200 is a `hidden beast` number, since 1 + 1 + 0 + 31 + 331 + 302 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 465907 + ... + 1556706.
Almost surely, 21103133130200 is an apocalyptic number.
1103133130200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1103133130200 is an abundant number, since it is smaller than the sum of its proper divisors (2734170150600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103133130200 is a wasteful number, since it uses less digits than its factorization.
1103133130200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2022739 (or 2022724 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 1103133130200 its reverse (20313313011), we get a palindrome (1123446443211).
The spelling of 1103133130200 in words is "one trillion, one hundred three billion, one hundred thirty-three million, one hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •