Base | Representation |
---|---|
bin | 1010000110001000101100… |
… | …1011000000011011011001 |
3 | 1110022012102001100200222022 |
4 | 2201202023023000123121 |
5 | 2423332341241124400 |
6 | 35335302511104225 |
7 | 2223662330446253 |
oct | 241421313003331 |
9 | 43265361320868 |
10 | 11100530411225 |
11 | 359a7880328a2 |
12 | 12b3435212075 |
13 | 626a10aa5a98 |
14 | 2a53a8c26cd3 |
15 | 143b3c267b85 |
hex | a188b2c06d9 |
11100530411225 has 12 divisors (see below), whose sum is σ = 13865129668284. Its totient is φ = 8815603710720.
The previous prime is 11100530411147. The next prime is 11100530411233. The reversal of 11100530411225 is 52211403500111.
It can be written as a sum of positive squares in 6 ways, for example, as 240480390544 + 10860050020681 = 490388^2 + 3295459^2 .
It is not a de Polignac number, because 11100530411225 - 212 = 11100530407129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11100530411194 and 11100530411203.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1620511964 + ... + 1620518813.
It is an arithmetic number, because the mean of its divisors is an integer number (1155427472357).
Almost surely, 211100530411225 is an apocalyptic number.
It is an amenable number.
11100530411225 is a deficient number, since it is larger than the sum of its proper divisors (2764599257059).
11100530411225 is a wasteful number, since it uses less digits than its factorization.
11100530411225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3241030924 (or 3241030919 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 11100530411225 its reverse (52211403500111), we get a palindrome (63311933911336).
The spelling of 11100530411225 in words is "eleven trillion, one hundred billion, five hundred thirty million, four hundred eleven thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •