Base | Representation |
---|---|
bin | 1010011000010111000100… |
… | …1100000101111010100100 |
3 | 1111102010120022000111101121 |
4 | 2212011301030011322210 |
5 | 2444000102014211321 |
6 | 40135203051503324 |
7 | 2255415214423312 |
oct | 246056114057244 |
9 | 44363508014347 |
10 | 11413627100836 |
11 | 3700545a44914 |
12 | 1344054757b44 |
13 | 64a3ba02b16c |
14 | 2b65cb4a30b2 |
15 | 14bd645c7441 |
hex | a6171305ea4 |
11413627100836 has 27 divisors (see below), whose sum is σ = 20031182244129. Its totient is φ = 5690478957408.
The previous prime is 11413627100807. The next prime is 11413627100851. The reversal of 11413627100836 is 63800172631411.
The square root of 11413627100836 is 3378406.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 8015297076900 + 3398330023936 = 2831130^2 + 1843456^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11413627100792 and 11413627100801.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2560829520 + ... + 2560833976.
Almost surely, 211413627100836 is an apocalyptic number.
11413627100836 is the 3378406-th square number.
It is an amenable number.
11413627100836 is a deficient number, since it is larger than the sum of its proper divisors (8617555143293).
11413627100836 is an frugal number, since it uses more digits than its factorization.
11413627100836 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9676 (or 4838 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 43.
The spelling of 11413627100836 in words is "eleven trillion, four hundred thirteen billion, six hundred twenty-seven million, one hundred thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •