Base | Representation |
---|---|
bin | 1010000001011101100001… |
… | …0111101101110111110101 |
3 | 1110000112010011102120202212 |
4 | 2200113120113231313311 |
5 | 2421023403112210401 |
6 | 35234341510143205 |
7 | 2215120232503535 |
oct | 240273027556765 |
9 | 43015104376685 |
10 | 11020221210101 |
11 | 35697166383a4 |
12 | 129b961951b05 |
13 | 61c2828a112c |
14 | 2a154ada14c5 |
15 | 1419dba6ddbb |
hex | a05d85eddf5 |
11020221210101 has 4 divisors (see below), whose sum is σ = 11020761146304. Its totient is φ = 11019681273900.
The previous prime is 11020221210091. The next prime is 11020221210181. The reversal of 11020221210101 is 10101212202011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11020221210101 - 238 = 10745343303157 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 (11020221210181) 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, 269937485 + ... + 269978306.
It is an arithmetic number, because the mean of its divisors is an integer number (2755190286576).
Almost surely, 211020221210101 is an apocalyptic number.
It is an amenable number.
11020221210101 is a deficient number, since it is larger than the sum of its proper divisors (539936203).
11020221210101 is an equidigital number, since it uses as much as digits as its factorization.
11020221210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539936202.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11020221210101 its reverse (10101212202011), we get a palindrome (21121433412112).
The spelling of 11020221210101 in words is "eleven trillion, twenty billion, two hundred twenty-one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •