Base | Representation |
---|---|
bin | 1010001100010010110011… |
… | …0000101110010000000101 |
3 | 1110200022110202100101220102 |
4 | 2203010230300232100011 |
5 | 2432101021041121000 |
6 | 35500040155013445 |
7 | 2234426033552204 |
oct | 243045460562005 |
9 | 43608422311812 |
10 | 11206320645125 |
11 | 3630634946371 |
12 | 130ba3a13a285 |
13 | 6339a0087a18 |
14 | 2aa562c9123b |
15 | 14677e9a23d5 |
hex | a312cc2e405 |
11206320645125 has 8 divisors (see below), whose sum is σ = 13985488165272. Its totient is φ = 8965056516000.
The previous prime is 11206320645119. The next prime is 11206320645133. The reversal of 11206320645125 is 52154602360211.
It can be written as a sum of positive squares in 4 ways, for example, as 3527669047681 + 7678651597444 = 1878209^2 + 2771038^2 .
It is not a de Polignac number, because 11206320645125 - 24 = 11206320645109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44825282456 + ... + 44825282705.
It is an arithmetic number, because the mean of its divisors is an integer number (1748186020659).
Almost surely, 211206320645125 is an apocalyptic number.
It is an amenable number.
11206320645125 is a deficient number, since it is larger than the sum of its proper divisors (2779167520147).
11206320645125 is an frugal number, since it uses more digits than its factorization.
11206320645125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89650565176 (or 89650565166 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 38.
The spelling of 11206320645125 in words is "eleven trillion, two hundred six billion, three hundred twenty million, six hundred forty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •