Base | Representation |
---|---|
bin | 1010000011111001100110… |
… | …0010000001101100000101 |
3 | 1110011112020221000222022021 |
4 | 2200332121202001230011 |
5 | 2422220203323333221 |
6 | 35305511034203141 |
7 | 2221132363562032 |
oct | 240763142015405 |
9 | 43145227028267 |
10 | 11062116621061 |
11 | 3585465497780 |
12 | 12a7ab45834b1 |
13 | 6231cb53b52c |
14 | 2a35a31a0389 |
15 | 142b3eb59041 |
hex | a0f99881b05 |
11062116621061 has 8 divisors (see below), whose sum is σ = 12068818321824. Its totient is φ = 10055590709520.
The previous prime is 11062116621001. The next prime is 11062116621067. The reversal of 11062116621061 is 16012661126011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11062116621061 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11062116621067) 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, 43815706 + ... + 44067451.
It is an arithmetic number, because the mean of its divisors is an integer number (1508602290228).
Almost surely, 211062116621061 is an apocalyptic number.
11062116621061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11062116621061 is a deficient number, since it is larger than the sum of its proper divisors (1006701700763).
11062116621061 is a wasteful number, since it uses less digits than its factorization.
11062116621061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87894611.
The product of its (nonzero) digits is 5184, while the sum is 34.
Adding to 11062116621061 its reverse (16012661126011), we get a palindrome (27074777747072).
The spelling of 11062116621061 in words is "eleven trillion, sixty-two billion, one hundred sixteen million, six hundred twenty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •