Base | Representation |
---|---|
bin | 1010001011111100011100… |
… | …1001111001011010101011 |
3 | 1110122201222121221220120121 |
4 | 2202333013021321122223 |
5 | 2432001224134014011 |
6 | 35453204553504111 |
7 | 2234124252455563 |
oct | 242770711713253 |
9 | 43581877856517 |
10 | 11200321001131 |
11 | 3629036238aa9 |
12 | 130a844a12037 |
13 | 6332550b5012 |
14 | 2aa154135da3 |
15 | 14652cdd9e71 |
hex | a2fc72796ab |
11200321001131 has 8 divisors (see below), whose sum is σ = 11280980056640. Its totient is φ = 11119663105992.
The previous prime is 11200321001119. The next prime is 11200321001173. The reversal of 11200321001131 is 13110012300211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11200321001131 - 235 = 11165961262763 is a prime.
It is a super-2 number, since 2×112003210011312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11200321001531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31873516 + ... + 32222998.
It is an arithmetic number, because the mean of its divisors is an integer number (1410122507080).
Almost surely, 211200321001131 is an apocalyptic number.
11200321001131 is a deficient number, since it is larger than the sum of its proper divisors (80659055509).
11200321001131 is a wasteful number, since it uses less digits than its factorization.
11200321001131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 580185.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11200321001131 its reverse (13110012300211), we get a palindrome (24310333301342).
The spelling of 11200321001131 in words is "eleven trillion, two hundred billion, three hundred twenty-one million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •