Base | Representation |
---|---|
bin | 10000000001100100110… |
… | …000010010111110011011 |
3 | 10220021101122212012111001 |
4 | 100001210300102332123 |
5 | 121020230203310021 |
6 | 2201515112445431 |
7 | 142362545433625 |
oct | 20014460227633 |
9 | 3807348765431 |
10 | 1101202010011 |
11 | 39502090a9a4 |
12 | 1595063a9877 |
13 | 7cac5b245bc |
14 | 3b426d9bc15 |
15 | 1d9a1287091 |
hex | 10064c12f9b |
1101202010011 has 8 divisors (see below), whose sum is σ = 1102892488704. Its totient is φ = 1099512129000.
The previous prime is 1101202009949. The next prime is 1101202010017. The reversal of 1101202010011 is 1100102021011.
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 1101202010011 - 211 = 1101202007963 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1101202010011.
It is not an unprimeable number, because it can be changed into a prime (1101202010017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3610710 + ... + 3903796.
It is an arithmetic number, because the mean of its divisors is an integer number (137861561088).
Almost surely, 21101202010011 is an apocalyptic number.
1101202010011 is a deficient number, since it is larger than the sum of its proper divisors (1690478693).
1101202010011 is an equidigital number, since it uses as much as digits as its factorization.
1101202010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298841.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1101202010011 its reverse (1100102021011), we get a palindrome (2201304031022).
The spelling of 1101202010011 in words is "one trillion, one hundred one billion, two hundred two million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •