Base | Representation |
---|---|
bin | 1010001011111011010000… |
… | …1110000101101111111001 |
3 | 1110122201011111012200222110 |
4 | 2202332310032011233321 |
5 | 2432000101323124423 |
6 | 35453113245042533 |
7 | 2234113344362010 |
oct | 242766416055771 |
9 | 43581144180873 |
10 | 11200003333113 |
11 | 3628992997351 |
12 | 130a776556449 |
13 | 63320433c38a |
14 | 2aa123c83a77 |
15 | 14651008b193 |
hex | a2fb4385bf9 |
11200003333113 has 48 divisors (see below), whose sum is σ = 17257818633216. Its totient is φ = 6329087720640.
The previous prime is 11200003333093. The next prime is 11200003333187. The reversal of 11200003333113 is 31133330000211.
It is not a de Polignac number, because 11200003333113 - 26 = 11200003333049 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 11200003333113.
It is not an unprimeable number, because it can be changed into a prime (11200003373113) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 130446108 + ... + 130531938.
It is an arithmetic number, because the mean of its divisors is an integer number (359537888192).
Almost surely, 211200003333113 is an apocalyptic number.
It is an amenable number.
11200003333113 is a deficient number, since it is larger than the sum of its proper divisors (6057815300103).
11200003333113 is an equidigital number, since it uses as much as digits as its factorization.
11200003333113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86582 (or 86473 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11200003333113 its reverse (31133330000211), we get a palindrome (42333333333324).
The spelling of 11200003333113 in words is "eleven trillion, two hundred billion, three million, three hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •