Base | Representation |
---|---|
bin | 1010000000111110111100… |
… | …0100110101000100001101 |
3 | 1102222201221001201200012022 |
4 | 2200033233010311010031 |
5 | 2420410100110401310 |
6 | 35230503142415525 |
7 | 2214406633202222 |
oct | 240175704650415 |
9 | 42881831650168 |
10 | 11012012200205 |
11 | 35661938937a5 |
12 | 129a2507315a5 |
13 | 61b574c6aa23 |
14 | 2a0daca4b949 |
15 | 1416ab039a55 |
hex | a03ef13510d |
11012012200205 has 4 divisors (see below), whose sum is σ = 13214414640252. Its totient is φ = 8809609760160.
The previous prime is 11012012200171. The next prime is 11012012200207. The reversal of 11012012200205 is 50200221021011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7618996624009 + 3393015576196 = 2760253^2 + 1842014^2 .
It is not a de Polignac number, because 11012012200205 - 230 = 11010938458381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012012200207) 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, 1101201220016 + ... + 1101201220025.
It is an arithmetic number, because the mean of its divisors is an integer number (3303603660063).
Almost surely, 211012012200205 is an apocalyptic number.
It is an amenable number.
11012012200205 is a deficient number, since it is larger than the sum of its proper divisors (2202402440047).
11012012200205 is an equidigital number, since it uses as much as digits as its factorization.
11012012200205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2202402440046.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 11012012200205 its reverse (50200221021011), we get a palindrome (61212233221216).
The spelling of 11012012200205 in words is "eleven trillion, twelve billion, twelve million, two hundred thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •