Base | Representation |
---|---|
bin | 1010000001100000110011… |
… | …1000000011001001101101 |
3 | 1110000121101112222111001110 |
4 | 2200120030320003021231 |
5 | 2421032204114213401 |
6 | 35235005134502233 |
7 | 2215151120114061 |
oct | 240301470031155 |
9 | 43017345874043 |
10 | 11021102101101 |
11 | 356a0288a8894 |
12 | 129bb68964979 |
13 | 61c393236b01 |
14 | 2a15d1d85aa1 |
15 | 141a3e0739d6 |
hex | a060ce0326d |
11021102101101 has 8 divisors (see below), whose sum is σ = 14697259739424. Its totient is φ = 7346172931760.
The previous prime is 11021102101063. The next prime is 11021102101109. The reversal of 11021102101101 is 10110120112011.
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 11021102101101 - 214 = 11021102084717 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021102101109) 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, 307096311 + ... + 307132196.
It is an arithmetic number, because the mean of its divisors is an integer number (1837157467428).
Almost surely, 211021102101101 is an apocalyptic number.
It is an amenable number.
11021102101101 is a deficient number, since it is larger than the sum of its proper divisors (3676157638323).
11021102101101 is an equidigital number, since it uses as much as digits as its factorization.
11021102101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614234491.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11021102101101 its reverse (10110120112011), we get a palindrome (21131222213112).
The spelling of 11021102101101 in words is "eleven trillion, twenty-one billion, one hundred two million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •