Base | Representation |
---|---|
bin | 1010001011111011101100… |
… | …1011100110101110111111 |
3 | 1110122201110121222012122000 |
4 | 2202332323023212232333 |
5 | 2432000321222403203 |
6 | 35453133020153343 |
7 | 2234116263151200 |
oct | 242767313465677 |
9 | 43581417865560 |
10 | 11200120122303 |
11 | 3628a42905842 |
12 | 130a7a9698853 |
13 | 6332225b09c8 |
14 | 2aa1355a55a7 |
15 | 14651a45a4a3 |
hex | a2fbb2e6bbf |
11200120122303 has 96 divisors (see below), whose sum is σ = 20790184377600. Its totient is φ = 5922217167552.
The previous prime is 11200120122299. The next prime is 11200120122311. The reversal of 11200120122303 is 30322102100211.
11200120122303 is a `hidden beast` number, since 1 + 120 + 0 + 120 + 122 + 303 = 666.
It is not a de Polignac number, because 11200120122303 - 22 = 11200120122299 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200120122313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4100076 + ... + 6261857.
It is an arithmetic number, because the mean of its divisors is an integer number (216564420600).
Almost surely, 211200120122303 is an apocalyptic number.
11200120122303 is a deficient number, since it is larger than the sum of its proper divisors (9590064255297).
11200120122303 is a wasteful number, since it uses less digits than its factorization.
11200120122303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10362018 (or 10362005 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11200120122303 its reverse (30322102100211), we get a palindrome (41522222222514).
The spelling of 11200120122303 in words is "eleven trillion, two hundred billion, one hundred twenty million, one hundred twenty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •