Base | Representation |
---|---|
bin | 1010001011111100011100… |
… | …1110111100101000011101 |
3 | 1110122201222201110011121120 |
4 | 2202333013032330220131 |
5 | 2432001230003400041 |
6 | 35453205042121153 |
7 | 2234124266641404 |
oct | 242770716745035 |
9 | 43581881404546 |
10 | 11200322325021 |
11 | 3629036a62725 |
12 | 130a8453501b9 |
13 | 63325545979b |
14 | 2aa15439c63b |
15 | 14652d09c366 |
hex | a2fc73bca1d |
11200322325021 has 8 divisors (see below), whose sum is σ = 14935132083360. Its totient is φ = 7466197058352.
The previous prime is 11200322324981. The next prime is 11200322325097. The reversal of 11200322325021 is 12052322300211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11200322325021 - 26 = 11200322324957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11200322324982 and 11200322325000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200323325021) 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, 171084735 + ... + 171150188.
It is an arithmetic number, because the mean of its divisors is an integer number (1866891510420).
Almost surely, 211200322325021 is an apocalyptic number.
It is an amenable number.
11200322325021 is a deficient number, since it is larger than the sum of its proper divisors (3734809758339).
11200322325021 is a wasteful number, since it uses less digits than its factorization.
11200322325021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 342245835.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 11200322325021 its reverse (12052322300211), we get a palindrome (23252644625232).
The spelling of 11200322325021 in words is "eleven trillion, two hundred billion, three hundred twenty-two million, three hundred twenty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •