Base | Representation |
---|---|
bin | 1010000000010010010001… |
… | …0010101000101100010101 |
3 | 1102221120222022111101011222 |
4 | 2200010210102220230111 |
5 | 2420211020122010401 |
6 | 35221201154340125 |
7 | 2213503516131341 |
oct | 240044422505425 |
9 | 42846868441158 |
10 | 11000020110101 |
11 | 356109a644a30 |
12 | 1297a6458a645 |
13 | 61a3b3645619 |
14 | 2a05920cc621 |
15 | 14120832cc1b |
hex | a01244a8b15 |
11000020110101 has 8 divisors (see below), whose sum is σ = 12110113884000. Its totient is φ = 9908274993840.
The previous prime is 11000020110071. The next prime is 11000020110119. The reversal of 11000020110101 is 10101102000011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11000020110101 - 238 = 10725142203157 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000020110151) 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, 4587163151 + ... + 4587165548.
It is an arithmetic number, because the mean of its divisors is an integer number (1513764235500).
Almost surely, 211000020110101 is an apocalyptic number.
11000020110101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11000020110101 is a deficient number, since it is larger than the sum of its proper divisors (1110093773899).
11000020110101 is a wasteful number, since it uses less digits than its factorization.
11000020110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9174328819.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 11000020110101 its reverse (10101102000011), we get a palindrome (21101122110112).
The spelling of 11000020110101 in words is "eleven trillion, twenty million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •