Base | Representation |
---|---|
bin | 10000000000011110011… |
… | …010111101000101100001 |
3 | 10220011100102111000001200 |
4 | 100000132122331011201 |
5 | 121010321113311314 |
6 | 2201202041151413 |
7 | 142321366545153 |
oct | 20003632750541 |
9 | 3804312430050 |
10 | 1100022010209 |
11 | 394575824651 |
12 | 15923718b569 |
13 | 7c968513675 |
14 | 3b354396ad3 |
15 | 1d93289c709 |
hex | 1001e6bd161 |
1100022010209 has 24 divisors (see below), whose sum is σ = 1616258323680. Its totient is φ = 720736892352.
The previous prime is 1100022010057. The next prime is 1100022010223. The reversal of 1100022010209 is 9020102200011.
It is not a de Polignac number, because 1100022010209 - 224 = 1100005232993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100022010191 and 1100022010200.
It is not an unprimeable number, because it can be changed into a prime (1100022010279) 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 23 ways as a sum of consecutive naturals, for example, 1866837 + ... + 2384349.
It is an arithmetic number, because the mean of its divisors is an integer number (67344096820).
Almost surely, 21100022010209 is an apocalyptic number.
It is an amenable number.
1100022010209 is a deficient number, since it is larger than the sum of its proper divisors (516236313471).
1100022010209 is a wasteful number, since it uses less digits than its factorization.
1100022010209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521581 (or 521578 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
The spelling of 1100022010209 in words is "one trillion, one hundred billion, twenty-two million, ten thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •