Base | Representation |
---|---|
bin | 1010001100000011011100… |
… | …1010001101101000000111 |
3 | 1110122220211120212122200000 |
4 | 2203000313022031220013 |
5 | 2432014101213211403 |
6 | 35454115242052343 |
7 | 2234221651016541 |
oct | 243006712155007 |
9 | 43586746778600 |
10 | 11202200132103 |
11 | 362990aa2aa02 |
12 | 130b08a1aa0b3 |
13 | 6334944bca36 |
14 | 2aa29192a691 |
15 | 1465dcd747a3 |
hex | a303728da07 |
11202200132103 has 48 divisors (see below), whose sum is σ = 17740555996800. Its totient is φ = 7044177584160.
The previous prime is 11202200132089. The next prime is 11202200132113. The reversal of 11202200132103 is 30123100220211.
11202200132103 is a `hidden beast` number, since 1 + 120 + 220 + 0 + 1 + 321 + 0 + 3 = 666.
It is not a de Polignac number, because 11202200132103 - 24 = 11202200132087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11202200132113) 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 47 ways as a sum of consecutive naturals, for example, 4240293 + ... + 6354878.
It is an arithmetic number, because the mean of its divisors is an integer number (369594916600).
Almost surely, 211202200132103 is an apocalyptic number.
11202200132103 is a deficient number, since it is larger than the sum of its proper divisors (6538355864697).
11202200132103 is a wasteful number, since it uses less digits than its factorization.
11202200132103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10595434 (or 10595422 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11202200132103 its reverse (30123100220211), we get a palindrome (41325300352314).
The spelling of 11202200132103 in words is "eleven trillion, two hundred two billion, two hundred million, one hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •