Base | Representation |
---|---|
bin | 1010000100001000111110… |
… | …0101001110100110111011 |
3 | 1110011220220121122212001102 |
4 | 2201002033211032212323 |
5 | 2422302132112434142 |
6 | 35311432420242015 |
7 | 2221336600362014 |
oct | 241021745164673 |
9 | 43156817585042 |
10 | 11066244655547 |
11 | 3587193680124 |
12 | 12a8866b4030b |
13 | 62370883aba3 |
14 | 2a387552200b |
15 | 142cd2270532 |
hex | a108f94e9bb |
11066244655547 has 4 divisors (see below), whose sum is σ = 11076793984200. Its totient is φ = 11055695326896.
The previous prime is 11066244655523. The next prime is 11066244655589. The reversal of 11066244655547 is 74555644266011.
11066244655547 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11066244655547 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11066244655492 and 11066244655501.
It is not an unprimeable number, because it can be changed into a prime (11066244655597) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5274662753 + ... + 5274664850.
It is an arithmetic number, because the mean of its divisors is an integer number (2769198496050).
Almost surely, 211066244655547 is an apocalyptic number.
11066244655547 is a deficient number, since it is larger than the sum of its proper divisors (10549328653).
11066244655547 is a wasteful number, since it uses less digits than its factorization.
11066244655547 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10549328652.
The product of its (nonzero) digits is 24192000, while the sum is 56.
The spelling of 11066244655547 in words is "eleven trillion, sixty-six billion, two hundred forty-four million, six hundred fifty-five thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •