Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …001010101001110001110 |
3 | 10220011022122221122201122 |
4 | 100000131301111032032 |
5 | 121010310320132042 |
6 | 2201201011240542 |
7 | 142321205032133 |
oct | 20003561251616 |
9 | 3804278848648 |
10 | 1100011099022 |
11 | 39456a651940 |
12 | 1592335a9152 |
13 | 7c966193144 |
14 | 3b352b5658a |
15 | 1d9319447d2 |
hex | 1001dc5538e |
1100011099022 has 8 divisors (see below), whose sum is σ = 1800018162072. Its totient is φ = 500005045000.
The previous prime is 1100011099021. The next prime is 1100011099039. The reversal of 1100011099022 is 2209901100011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1100011098982 and 1100011099000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100011099021) 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 3 ways as a sum of consecutive naturals, for example, 25000252229 + ... + 25000252272.
It is an arithmetic number, because the mean of its divisors is an integer number (225002270259).
Almost surely, 21100011099022 is an apocalyptic number.
1100011099022 is a deficient number, since it is larger than the sum of its proper divisors (700007063050).
1100011099022 is a wasteful number, since it uses less digits than its factorization.
1100011099022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50000504514.
The product of its (nonzero) digits is 324, while the sum is 26.
Adding to 1100011099022 its reverse (2209901100011), we get a palindrome (3309912199033).
The spelling of 1100011099022 in words is "one trillion, one hundred billion, eleven million, ninety-nine thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •