Base | Representation |
---|---|
bin | 10000000000011110010… |
… | …111111001101110011011 |
3 | 10220011100100222100101201 |
4 | 100000132113321232123 |
5 | 121010320412210021 |
6 | 2201202012055031 |
7 | 142321360003213 |
oct | 20003627715633 |
9 | 3804310870351 |
10 | 1100021210011 |
11 | 394575328429 |
12 | 159236a64477 |
13 | 7c9682c3389 |
14 | 3b354229243 |
15 | 1d932790591 |
hex | 1001e5f9b9b |
1100021210011 has 4 divisors (see below), whose sum is σ = 1100155843224. Its totient is φ = 1099886576800.
The previous prime is 1100021209997. The next prime is 1100021210077. The reversal of 1100021210011 is 1100121200011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1100021210011 - 27 = 1100021209883 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 1100021210011.
It is not an unprimeable number, because it can be changed into a prime (1100021217011) 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, 67304350 + ... + 67320691.
It is an arithmetic number, because the mean of its divisors is an integer number (275038960806).
Almost surely, 21100021210011 is an apocalyptic number.
1100021210011 is a deficient number, since it is larger than the sum of its proper divisors (134633213).
1100021210011 is an equidigital number, since it uses as much as digits as its factorization.
1100021210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134633212.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1100021210011 its reverse (1100121200011), we get a palindrome (2200142410022).
The spelling of 1100021210011 in words is "one trillion, one hundred billion, twenty-one million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •