Base | Representation |
---|---|
bin | 1010001011111100110010… |
… | …0101100010001100000111 |
3 | 1110122202012222102211202210 |
4 | 2202333030211202030013 |
5 | 2432001421001211403 |
6 | 35453222011034503 |
7 | 2234126440201545 |
oct | 242771445421407 |
9 | 43582188384683 |
10 | 11200412132103 |
11 | 3629082722057 |
12 | 130a86b43ba33 |
13 | 63326ac4197c |
14 | 2aa162298d95 |
15 | 146535ddbb03 |
hex | a2fcc962307 |
11200412132103 has 8 divisors (see below), whose sum is σ = 15101679279600. Its totient is φ = 7383043203008.
The previous prime is 11200412132057. The next prime is 11200412132111. The reversal of 11200412132103 is 30123121400211.
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 11200412132103 - 212 = 11200412128007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11200412132103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200412132113) 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, 20974554288 + ... + 20974554821.
It is an arithmetic number, because the mean of its divisors is an integer number (1887709909950).
Almost surely, 211200412132103 is an apocalyptic number.
11200412132103 is a deficient number, since it is larger than the sum of its proper divisors (3901267147497).
11200412132103 is an equidigital number, since it uses as much as digits as its factorization.
11200412132103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41949109201.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11200412132103 its reverse (30123121400211), we get a palindrome (41323533532314).
The spelling of 11200412132103 in words is "eleven trillion, two hundred billion, four hundred twelve million, one hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •