Base | Representation |
---|---|
bin | 10000000001011001111… |
… | …101111000001101010011 |
3 | 10220020221001022000020202 |
4 | 100001121331320031103 |
5 | 121014342340133021 |
6 | 2201445125325415 |
7 | 142355220156122 |
oct | 20013175701523 |
9 | 3806831260222 |
10 | 1101021021011 |
11 | 394a3873220a |
12 | 15947586686b |
13 | 7ca97495512 |
14 | 3b40ad27ab9 |
15 | 1d990435a0b |
hex | 10059f78353 |
1101021021011 has 4 divisors (see below), whose sum is σ = 1103529042000. Its totient is φ = 1098513000024.
The previous prime is 1101021020959. The next prime is 1101021021043. The reversal of 1101021021011 is 1101201201011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101021021011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101021020983 and 1101021021001.
It is not an unprimeable number, because it can be changed into a prime (1101021021211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1254009836 + ... + 1254010713.
It is an arithmetic number, because the mean of its divisors is an integer number (275882260500).
Almost surely, 21101021021011 is an apocalyptic number.
1101021021011 is a deficient number, since it is larger than the sum of its proper divisors (2508020989).
1101021021011 is an equidigital number, since it uses as much as digits as its factorization.
1101021021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2508020988.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1101021021011 its reverse (1101201201011), we get a palindrome (2202222222022).
The spelling of 1101021021011 in words is "one trillion, one hundred one billion, twenty-one million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •