Base | Representation |
---|---|
bin | 10000000001011010000… |
… | …001101001111011011101 |
3 | 10220020221010011022101202 |
4 | 100001122001221323131 |
5 | 121014343113323401 |
6 | 2201445202445245 |
7 | 142355231451515 |
oct | 20013201517335 |
9 | 3806833138352 |
10 | 1101022011101 |
11 | 394a39249071 |
12 | 159476063825 |
13 | 7ca9775107c |
14 | 3b40b104845 |
15 | 1d99057e06b |
hex | 1005a069edd |
1101022011101 has 4 divisors (see below), whose sum is σ = 1165788011772. Its totient is φ = 1036256010432.
The previous prime is 1101022011071. The next prime is 1101022011209. The reversal of 1101022011101 is 1011102201011.
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 790722879076 + 310299132025 = 889226^2 + 557045^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101022011101 - 222 = 1101017816797 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 (1101022011301) 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, 32383000310 + ... + 32383000343.
It is an arithmetic number, because the mean of its divisors is an integer number (291447002943).
Almost surely, 21101022011101 is an apocalyptic number.
It is an amenable number.
1101022011101 is a deficient number, since it is larger than the sum of its proper divisors (64766000671).
1101022011101 is an equidigital number, since it uses as much as digits as its factorization.
1101022011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64766000670.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1101022011101 its reverse (1011102201011), we get a palindrome (2112124212112).
The spelling of 1101022011101 in words is "one trillion, one hundred one billion, twenty-two million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •